OJ Board

I am getting WA in this problem. I don't know whats wrong with my algo. Please give me some I/O. Thaks in advance.

I am getting WA. Can anyone please give me some i/o?? Thanks in advance.

I am getting WA. Can anyone give me some i/o?? Thanks in advance.

I am getting WA. Please help.

You need not to check at a[0]. a[0]-0 can be greater than 100. if you have a charging station at 0 and at 150 you can travel. you have to check while returning.

Got AC. Thanks Leonid.

Should I consider that her journey begins form 0 and ends at 1422? My algo is something like that: I am taking the input in an array & sort it. Then I am checking difference between index 0&1, 1&2, 2&3.... is<=200. Is it correct??

I am getting WA. Can anyone give me any hints.

It seems that input will be given once for this problem. Whatever you can solve it while taking input.
first read a char from input,
if(ch==' '){
//check if str is the longest word or not. If it is copy it into another string lets say str1;
//also check this if(!strcmp(str,"E-N-D")) break;
}
else if ...

I think changing "double db" with "unsigned long db" and "db=sqrt(n)" with "db=(unsigned long)sqrt(n)" will do. Hope you got AC by the time..

Got AC after 3 TLE and 3 WA.

I tried a lots of input sets and my algo gives correct output but still WA. Is there any thing i am not noticing????

I tried that. But I was getting WA. Now I got AC. I was making some silly mistakes in initialization. Thanks a lot.

I am getting WA. Give me some test case. Thanks in advance.

I am getting WA in 200. Can anyone give me some I/O. Thanks in advance.