Pagini recente » Cod sursa (job #1984581) | Cod sursa (job #2750556) | Borderou de evaluare (job #1091330) | Cod sursa (job #2572177) | Cod sursa (job #125013)
Cod sursa(job #125013)
#include<stdio.h>
int t;
long p[101],b[101];
void read()
{
int i;
scanf("%d",&t);
for(i=1;i<=t;i++)
scanf("%ld %ld",&p[i],&b[i]);
}
void rezolva()
{
long por,ban,max,q;
int i;
for(i=1;i<=t;i++)
{
por=p[i];
ban=b[i];
for(q=1;;q++)
{
if(por>=2)
{
por=por-2;
por++;
}
else
if(ban>=2)
{
ban=ban-2;
por++;
}
else
{
ban--;
por--;
ban++;
}
if(por==1)
{printf("0\n");break;}
if(ban==1)
{printf("1\n");break;}
}
}
}
int main()
{
freopen("fructe.in","r",stdin);
freopen("fructe.out","w",stdout);
read();
rezolva();
return 0;
}