Pagini recente » Cod sursa (job #1109059) | Cod sursa (job #841720) | Cod sursa (job #1852270) | Cod sursa (job #3351881) | Cod sursa (job #1332289)
#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(p[i]%2==0){p[i]=p[i]/2;p[i]++;}
while(b[i]%2==0){b[i]=b[i]/2;p[i]++;}
if(b[i]<=p[i])p[i]=p[i]-b[i];
else p[i]=0;
if(p[i]==0)u[i]=b[i]%2;
if(b[i]==0)u[i]=p[i]%2;
}
for(i=1;i<=t;i++)g<<u[i]<<endl;
return 0;
}