OJ Board

Well, it seems this problem has O(n)solution at best - > number of sums = n/x, where x is a product of function F(n), F(n) is not linear, more of a combination of linear and logarithmic function.

There might be a faster solution, but cba to find it :p

From my analysis there may be a logn solution...i will post again soon

check if there can be cases causing your algo to divide by zero, for a start...in your case...
ordLen != 0
expLen != 0
ordLen != -expLen
Also your fucntion "int addTrain(int queue[], int &pos, int leave)"...first parameter does not refer to any global array of ints, nor does it work with any array ...

Try to change
while (scanf("%d %d %s", &oriBase, &newBase, &oriValue))
to
while (scanf("%d %d %s", &oriBase, &newBase, &oriValue)==3)

This is so simple problem...yet i keep getting WA no matter what i do, while in my tests, there are no mistakes :-?
The frequencies and words belonging to them are correct so i guess there is either a mistake in my formatting or in the way i read data...

My output has this format.
Analysis for ...

Thanks mf,
Yes you are quite right i do not understand how memory works, i knew that functions free memory of their local variables when they finish, but didnt know it aplies to cycles aswell(and at the same time i use for(){} regularly, i am dumb :D)

About reinventing the wheel, you are right. But ...

Hello there,
i am new to the whole c++ language and now i hit a problem i am not able to figure out.
It appeared to me while i tried to solve 10954-Add All problem. Everything worked on my computer and my code solved all test cases i could think off in no time and correctly. But when i submitted ...