Search found 5 matches

by animeshnayan
Tue Apr 17, 2007 8:20 am
Forum: Volume 100 (10000-10099)
Topic: 10067 - Playing with Wheels
Replies: 62
Views: 24088

I too got ACC :D :D ... BFS is enough to get a solution, but how to manage time .. i solve it in 6.6 sec
by animeshnayan
Mon Apr 16, 2007 10:12 am
Forum: Volume 100 (10000-10099)
Topic: 10037 - Bridge
Replies: 84
Views: 24019

I got AC finally..
by animeshnayan
Mon Apr 16, 2007 10:11 am
Forum: Volume 100 (10000-10099)
Topic: 10067 - Playing with Wheels
Replies: 62
Views: 24088

I too get TLE using simple BFS... :o :o
by animeshnayan
Tue Mar 20, 2007 8:31 am
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 182644

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 hi, hj; unsigned ...
by animeshnayan
Tue Mar 20, 2007 7:57 am
Forum: Volume 100 (10000-10099)
Topic: 10037 - Bridge
Replies: 84
Views: 24019

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.

Code: Select all

Got Ac:))

Go to advanced search