ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1133. Fibonacci Sequence

Funny solution
Posted by Samsonov Alex [SESC USU] 5 Jul 2005 12:44
I got AC in C++ using binary search... Of course, I had to use int64 to check whether all the nums are less than 2000000000, but it's easy enough... There is no problem with TL because abs(i,j)<=1000...