Pagini recente » Cod sursa (job #99595) | Cod sursa (job #2983913) | Cod sursa (job #1866306) | Cod sursa (job #263361) | Cod sursa (job #1332313)
#include <iostream>
#include<fstream>
using namespace std;
int t,p[101],b[101],u[101],i;
int main()
{
ifstream f("fructe.in");
ofstream g("fructe.out");
f>>t;
for(i=1;i<=t;i++)
{
f>>p[i]>>b[i];
while(b[i]>2){b[i]=b[i]/2;p[i]++;}
while(p[i]>2){p[i]=p[i]/2;p[i]++;}
if(b[i]<=p[i])p[i]=0;
else p[i]=1;
if(p[i]==0)u[i]=1;
if(b[i]==0)u[i]=0;
}
for(i=1;i<=t;i++)g<<u[i]<<endl;
return 0;
}