OJ Board

Many thanks to yz. Got AC for this problem

i had a problem in the 'remaining time' calculation which I corrected using the way yz specified
ceil(remainBytes / ((float)transferedBytes / 5))

-Moinul(AUST)

Allthough I had the problem solved long ago...

Thanks to UFP2161 for respnsing to this query..
I hope, it will help others trying to sove 784

----------------------------------------------------------

Moinul,
Bangladesh

The problem is a simple one but getting WA. I think, my mistake lies in the output format.
Can anyone Help me specifying on how to format the output.

The problem suggests that, the output should be exactly like input along with the separation line. But, will there be any newline between two ...

Thanks to Andrey Mokhov for pointing out about the Strcmp() return values. Yes, Strcmp() doesn't always return +/- 1

So, I have changed the strcmp() values to >0 and <0 and got 'AC'.
I have left the swap (from,to) option unchanged and got AC, which means , the Judge input doesn't have any value ...

I am always getting WA... Tested my program with Caesum's input. It seems to give correct result.

This is what i did to compare the pre-generated fibonacci numbers from the String array.


//used 'from' and 'to' string to read the range.
// swaping the number range if from > to ;
if (strlen(from ...

Many Thanks to Robbie,

Your last two line

701997118012300111111117
3333332351100101110150141120123101411792310178

helped me identifying a minor mistake in my program

-Moinul

This is an easy problem...
Well, Try with these inputs
------------------------------------------------------------
12

cdefgab

BAGFEDC
CbCaDCbCbCCbCbabCCbCbabae

BAAGFFEDCbabbabbbabbbabab
ccccCCdccaccacccccaaacccc
cacacaaBBBBcCbbbbBAAGGGGG
GFGFGGaaaaFFgGgGbcdefgabbbbbbbbbbbbb ...

What is the Problem with 10183?
Is there anything exceptional case in the problem? I have used the fibonacci series from 1 2 3 5 8 13 ... and got WA.

Since the input range is a ,b <=10^100... I used string operation to generate all the first 5000 fibo. (allthough 5000th fibo is of 1045 digit long ...

At last , I have made the problem accepted in 0:00.156 sec, without any backtracking. :P

I did some calculation on the given row x col, & shown the output directly.

But, for the cases where any of row or col is less than 3, I stored the results of those cases in a 500x2 array. :lol:

Thanks to ...

I am getting Correct answer for a Board of less than 300x300
I have checked all the suggested inputs above and it seems to count the Knights correctly.
But For a board of 500x500 or less, I am getting 'Time Limit Exceeds'.

I did simple backtracking To place the nights statring from (0,0)
Can ...

Write an effective String Addition function and you can get the 495 accepted ... :D


5000th Fibo is:

387896845438832563370191630832590531208212771464624510616
059721489555013904403709701082291646221066947929345285888
297381348310200895498294036143015691147893836421656394410 ...