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 2079. Memory leaks

Shen Yang Xn+1==(sqrt(5*Xn*Xn+4*(-1)^n)+Xn)/2 [4] // Problem 2079. Memory leaks 2 Dec 2017 09:23
rt
Shen Yang Re: Xn+1==(sqrt(5*Xn*Xn+4*(-1)^n)+Xn)/2 [3] // Problem 2079. Memory leaks 2 Dec 2017 15:17
first for bound=1e5,using matirx power to compute x0,x1  x[bound],x[bound+1] ,x[2*bound],x[2*bound+1].....  upper bound is 2*p   using map to record  (x[i*bound],x[i*bound+1])

I use this formula and discrete log algo to find candidate of xn+1

then continue to compute xn-1 xn-2 .... until we find (xi,xi+1) in the map then it is valid
otherwise it is invalid
complex : sqrt(p*log(p))

Edited by author 02.12.2017 15:17
rausen Re: Xn+1==(sqrt(5*Xn*Xn+4*(-1)^n)+Xn)/2 [2] // Problem 2079. Memory leaks 6 Mar 2018 19:13
Could you do me a favor to explain the meaning of this problem?
My teammates and me are working on this but we can hardly get the point.
Thx for helping anyway.
p.s. Chinese would be better XD
Shen Yang Re: Xn+1==(sqrt(5*Xn*Xn+4*(-1)^n)+Xn)/2 [1] // Problem 2079. Memory leaks 7 Mar 2018 12:33
给定 斐波那契 的某一项 %p的值x,求它的下一项 %p的所有可能值
请问斐波那契的一阶递推式是怎样推导的?