OJ Board

I too got ACC ... BFS is enough to get a solution, but how to manage time .. i solve it in 6.6 sec

I got AC finally..

I too get TLE using simple BFS...

With this new code, I receive the same anwsers as statefull's had tested before -with the exception of the 787843 case, that seems not to finish... #include <stdio.h> using namespace std; int main() { unsigned long int i, j, n; while (scanf("%ld %ld",&i,&j)==2) { unsigned long int...

I think I am following the algorithm given at the start of this thread...getting WA ... I can't work out the test cases ... Somebody who has got AC help plzzz.