UVa OJ Board

had a little refresh problem.
got AC.

please give me some I/O.

thanks in advance.

waiting for my 5th semister final.
just feel curious.
by the word "toughest" i mean the course for which u spent much time & labour.

my pick.....

course name:

Mathetical Analysis For Computer Science.(3 credit)

course material:

probability models &
concrete mathematics.

hi actually u dont need a compact biginteger class found & discussed in the board. u need a structure with only addition function. so declare a structure(take help from ur c++ book) with the variables. take input as a string. & for each character in the string subtruct '0' to get the desired number....

i havnt tested ur code just had a look at it.
i dont think u need a post fix form.
because if u r building tree u can evaluate on the process.
if u havnt solved it yet i can help.

no string copy is required.
after p=strtok(params)
you can use temp=atol(p);
i think this is the easiest way to parse a line for
unknown number of inputs.

Thanks.

my code gives the same output.
but still WA.

I got wrong answer.
Can someone give me some I/O.

I used greedy for this proble.
but got WA.
please give me some I/O.

had a little problem.
Got accepted.

I simply generated the whole table for the maximum size.
and after reading a number print positionX[number],positionY[number].
got wrong ans.

please give me some I/O.

get the lines by string & learn how to use the C library function strtok()
that will help.

hmm changed a bit & got the correct ans .
but this time got TLE.
what is the faster method to solve it.
can you explain please.

thanks for the help.

I used modified floyd-warshall & managed a wrong ans.
please give me some I/O.