Good day! I'm interested in the solution of the following problem via Ford-Bellman algorithm, because I only solved the one via Dijkstra. But my solution was not enough successful (4 tests of 13 passed).
Statement of the problem:
Any suggestion?
# | 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 | 164 |
3 | adamant | 162 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | pajenegod | 145 |
9 | SecondThread | 145 |
Good day! I'm interested in the solution of the following problem via Ford-Bellman algorithm, because I only solved the one via Dijkstra. But my solution was not enough successful (4 tests of 13 passed).
Statement of the problem:
Any suggestion?
Good day! I am trying to solve task 1673 from acm.timus.ru(click). I tried to solve this problem by the following way. 1) Firstly I precalculate the euler function for numbers from 1 till 2*10^5. 2) Then I start to search required value in array. But this solution has passed only 6 tests(in my version). In the 7th test It is needed to give answer for number which is more than 2*10^5 (2*10^9 is the max value of euler function in the problem). I want to know how we can quickly calculate argument of the euler if we know the value. My code(click)
Name |
---|