OJ Board

Thaks, i must recode it.

Hello,
i got TLE for this program.
i use BFS to find the shortest path.
is my algorithm is wrong?
pls help me.

Thanks for your interest.
i am S.A.M Harun.
i solve 250 problem. and resistered in 2001.
my age is 22.
bye.

Hello, i donot know why this program is TLE ?.
Is there anybody to help me.
sory for the code.
if my algorithm is wrong tell me the right one.


here is the code:-
-----------------------

#include<stdio.h>

long mod(long h)
{
while(h%10==0)
{
h/=10;
if(h==0)break;
}
return h%10;
}

int main ...

I use DFS for this 10477 problem. in my program i use DFS three(3) times. i think that causes TLE. But how can i use only one DFS call for this problem?

Hello, i solve the problem 10477. but i got TLE.
Who can i overcome it.
May be my algorithm is Bad. Is their anybody who provide me a good algorithm ?