Pagini recente » Cod sursa (job #2222611) | Cod sursa (job #771367) | Cod sursa (job #2259452) | Cod sursa (job #398783) | Cod sursa (job #1266364)
# include <bits/stdc++.h>
using namespace std;
ifstream fi("fibo3.in");
ofstream fo("fibo3.out");
long long s[85];
int main(void)
{
int n;
fi>>n;
long long x,y,x1,y1;
s[1] = s[2] = 1;
for (int i=3;i<76;++i) s[i] = s[i-1] + s[i-2];
while (n --)
{
fi >> x >> y >> x1 >> y1;
long long ans=0;
for (int i=2;i<76;++i)
if (x+y<=s[i] && s[i]<=x1+y1) ans += min(x1,s[i]-y) - max(x,s[i]-y1) + 1;
fo << ans << '\n';
}
return 0;
}