Pagini recente » Cod sursa (job #1460803) | Cod sursa (job #2537650) | Cod sursa (job #1518406) | Cod sursa (job #2710488) | Cod sursa (job #1240478)
#include<fstream>
using namespace std;
ifstream in ("fibo3.in");
ofstream out ("fibo3.out");
int n;
long long v[76], a, b, c, d;
int main()
{
v[1]=v[2]=1;
for (int i=3; i<=75; i++)
v[i]=v[i-1]+v[i-2];
in>>n;
for (int i=1; i<=n; i++)
{
in>>a>>b>>c>>d;
int j=2; long long nr=0;
while (v[j]<a+b) j++;
while (v[j]<=c+d)
{
nr=nr+min(c, v[j]-b)-max(a, v[j]-d)+1;
j++;
}
out<<nr<<'\n';
}
out.close();
return 0;
}