1) graph G consists of n nodes and m edges 2) G is a directed acyclic graph 3) n<=300 & m<=400 4) Number of simple paths from vertex 1 to vertex n is equal to k.
then what is the maximum value for k for the given constraints.
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
1) graph G consists of n nodes and m edges 2) G is a directed acyclic graph 3) n<=300 & m<=400 4) Number of simple paths from vertex 1 to vertex n is equal to k.
then what is the maximum value for k for the given constraints.
Name |
---|
Lol try to think rather than asking hints for a problem from ongoing Contest.
what contest is that?
It's hackerearth's august circuit'20
I don't want to submit the answer and get more rating. I just want to know the answer..
Just try to think you will get go the solution. Contest will end after 4 days. You can post a blog after that.