NEW PROBLEM 1396 “Maximum. Version 2” has been added. (-)
This problem is the same as 1079 “Maximum” but with bigger limitations.
Edited by author 10.05.2006 19:37
I have a proposal (+)
The problem is just added, so it may be easily modified. Let it be more than 10000 lines in input - so that the TL would be strict enough and my solution get TLE ;)
Edited by author 11.05.2006 12:21
Your solution is fast enough, don't tount at me (-)
:Ashamed: I did not mean to taunt. I just want this problem to become harder a bit (-)
Oh! Limitations too weak indeed! I think that N < 10^18 would be better :)
Burunduk1, please, resubmit your solution for N < 10^18. I will use your solution to generate new tests ;-)
Edited by author 11.05.2006 15:31
I've resubmited it. (ID=1187372)
Re: I've resubmited it. (ID=1187372)
This code will get WA with N < 10^18.
Guess why?
Re: This code will get WA with N < 10^18.
And for N < 10^17 ?
Try to change "__int64" to "unsigned __int64".
Oups... I need a new solution for 10^18 ;) (-)
Re: Yes, for N < 10^17 too
Please, give me my AC solution!!! (to sk1@hotbox.ru)
I modified it (of course without backup) and now it
doesn't pass second test. (or you've already added new tests?)
PS: This ability (to view submitted solutions) is useful.
Limitations were changed, problem rejudged
Re: Limitations were changed, problem rejudged
I see...
And why you haven't got AC?
Sent (+)
And now there is only one test
Re: Sent (+)
I see... (know the same solution gets WA 1)
My solution is bad :) It work for N < 10^11 only (-)
Have you received my letter?
Re: Have you received my letter?
AC ;)
!!!
:)
Re: Have you received my letter?
The bug was in this:
I calculated F[i] int 32-bit integer.