OJ Board

i actually didn't analize your code but when i tried with some input i found your code sometimes prints blank line before an output and sometimes after output and after all it gets messed up. try the following input: 2 abcd abcd EndOfText 2 abcd EndOfText 2 abcd abcd EndOfText 2 abcd EndOfText hope ...

you are not printing blank line correctly.

your problem seems so simple!!
declare a character array of size 1000001 and just read an string. following code wud work:
[cpp]char str[1000001];
int main()
{
cin>>str;
return 0;
}
[/cpp]

good luck
-sohel

ps- always declare such large arrays global.

consider the following input:

9999 5000 9999 5256

my program's output is:

521350.34067

your program doesn't seems like giving the same result!!

good luck
-sohel

using log doesn't work for this problem. i tried to use log too but faild. it seems that the judge solution was not written using log so there exists some precision error. i solved this using brutforce

i wish this problem cud have been an special judge problem.

thanx
-sohel

you'd better use VC.
TC wud never support such large array required for this problem.

thanx
-sohel

u need to modify your code a little to get AC.

code to change: code to replace with: hope u can understand why the change was needed.

good luck
-sohel

i think your terminating condition is not right.
i can remember that i terminated when i expected -9999 but got something else.

it might help.

thanx
-sohel

silly mistake!!!
what does this following line mean? good luck
-sohel

i used backtracking a with a little bound. i just checked the last move
not to be repeated.my soln. is not fast enough though!
but i think the best approach is to use BFS. some ppl used IDS also.

thanx
-sohel

your output seems a bit weird to me, coz u've printed some
spaces after the end of second line. r u sure there will be
spaces? you've printed 3 extra spaces at the place where i put '@'.

im actually screwed. getting WA

thanx
-sohel

u'd better try to use struct and store every number as string (important! bcoz u need to print exactly the same as input) and corresponding indices and sort the array according to the indices. u can use qsort for sorting. following code might help: [c] typedef struct { int index; char num[20]; } arr...

try the following i/o hope this helps

-sohel

u can try the following 2 inputs and outputs: input: 5 6 -3 -4 -1 -2 -8 -6 -6 -1 -8 -2 -7 -4 -5 -9 -3 -9 -9 -5 -8 -4 -1 -3 -2 -6 -3 -7 -2 -8 -6 -4 10 100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

its possible bcoz its an special judge problem.
an special corrector program is written for this problem to ignore small precision error.