how can i remove(delete) my question from forum...??
This question is marked "community wiki".
asked 27 Jun '15, 17:25

I read this problem and also the solution. This problem don't have weak test cases, but they'll pass using some hashing technique and some may not work answered 27 Jun '15, 22:25

collision here means that you are hashing all the fibonacci numbers by 2^641 which may map two different values at the same place. Though you are not directly using hashing but When there is overflow then calculation is done automatic by taking modulo by the largest number that can fit in that data type. answered 27 Jun '15, 22:40

@dracowane. I think it is unfair to blame the test cases just because of the hashing solution passed with modulus 2^64. Solutions with an extremely high probability to pass is obviously a correct solution for the contest's/problem's purpose. It is not possible for the problem author to prepare tests against a specific hashing technique/parameter as these are unknown to the author. Besides you can use multiple hashing with different parameters to increase the success rate of such hashing based solution. So IMO this should not be called "weak test cases". answered 28 Jun '15, 05:26
Hey, chill!, well i am sorry to blame test cases, but this solution, modulo 2^641 was a naive solution, some coders code it assuming that everything will fit in unsigned long long and it passed and some coders were struggling knowing that 1000 digit number can't be stored in unsigned long long and was thinking about something else! so i feel that cause of test cases, many suffered so i called them weak. well i'll edit my answers :)
(28 Jun '15, 16:57)

Answer is hidden as author is suspended. Click here to view.
answered 24 Aug '15, 15:46

sorry for weak test case data...thanks for response....guys answered 28 Jun '15, 20:11

one more solution , you can close your question too.... answered 26 Aug '15, 02:05
