Tweet
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
long long findd(long long i,long long fi,long long j,long long fj,long long l,long long r)
{
while(l<=r)
{
long long mid=(l+r)/2;
long long t1,t2,t3;
t1=fi;t2=mid;
for(long long t=i+2;t<=j;t++)
{
t3=t1+t2;
t1=t2;t2=t3;
}
if(t3>fj) r=mid-1;
else if(t3<fj) l=mid+1;
else return mid;
}
return 0;
}
int main()
{
long long i,fi,j,fj,n;
ifstream f("FIBOSEQ.INP");
f>>i>>fi>>j>>fj>>n;
if(i>j)
{
long long temp=i;i=j;j=temp;
temp=fi;fi=fj;fj=temp;
}
f.close();
ofstream ff("FIBOSEQ.OUT");
long long temp;
if(j>i+1)
{
temp=findd(i,fi,j,fj,-2*pow(10,9),2*pow(10,9));
}
else if(j==i+1)
{
temp=fj;
}
if(n==i)
{
ff<<fi<<endl;
}
else if(n==i+1)
{
ff<<temp<<endl;
}
else if(n>i)
{
long long t1,t2,t3;
t1=fi;t2=temp;
for(long long t=i+2;t<=n;t++)
{
t3=t1+t2;
t1=t2;t2=t3;
}
ff<<t3<<endl;
}
else if(n<i)
{
long long t1,t2,t3;
t1=temp;t2=fi;
for(long long t=i-1;t>=n;t--)
{
t3=t1-t2;
t1=t2;t2=t3;
}
ff<<t3<<endl;
}
return 0;
}
Comment