OJ Board

Hi... my code passes for all the test cases given in this thread. but i got WA for many time. please give me some more test case for this problem. i post my code below.

Hlw bro..just remove all the complex thinking about the problem..
If u think some input and output there is a relation u can ...

why i am getting TLE
please help

First find out the sorted form of strings in O(nlgn) time . U can sort it by qsort too.
Then scan previous and next string to find if the previous string is a substring of next string.
Hope it will help...
##############################################
I have ...

Obaida wrote:Some 1 plz help!!!

Hello boss plz read the problem carefully..
u have done mistakes in inc() and dec() function.
U have skiped the mod 10.
And afterall try to use gets and sscanf() as suggested by MRH.

I am unable to understand this problem. Can someone please explain it to me??
Than in advance
Its not so hard as u thinking. Just take strings one after another and find out the common bases. Take only common bases and compare it with next string untill the common bases string is not NULL. If NULL ...