Pagini recente » Cod sursa (job #2136371) | Cod sursa (job #2503526) | Cod sursa (job #305446) | Cod sursa (job #2407807) | Cod sursa (job #520295)
Cod sursa(job #520295)
#include <stdio.h>
long int nf, i, ii, t;
long long doi, max, x1, x2, y1, y2, s, z5;
long int f[100];//!!!!1
long long min(long long a, long long b)
{
if (a<b)
return a;
else
return b;
}
int main()
{
freopen("fibo3.in","r",stdin);
freopen("fibo3.out","w",stdout);
z5=100000;
doi=2;
max=doi*z5*z5*z5;//
f[1]=1; f[2]=1;
for (i=3;f[i-1]+f[i-2]<=max&&f[i-1]+f[i-2]>0;i++)
f[i]=f[i-1]+f[i-2];
nf=i-1;
scanf("%ld",&t);
for (ii=1;ii<=t;ii++)
{
scanf("%lld %lld %lld %lld",&x1, &y1, &x2, &y2);
s=0;
for (i=2;i<=nf;i++)
if (f[i]>=x1+y1)
{
if (f[i]>x2+y2)
break;
if (f[i]<=x1+y2)
s+=min(f[i]-x1-y1+1,x2-x1+1);
else
s+=min(x2+y2-f[i]+1,y2-y1+1);
}
printf("%ld\n",s);
}
return 0;
}