Pagini recente » Cod sursa (job #1832036) | Cod sursa (job #1872969) | Istoria paginii runda/becreative17/clasament | Cod sursa (job #1971349) | Cod sursa (job #1572042)
#include <fstream>
using namespace std;
int main()
{
int n,p,b,i,ok;
ifstream f("fructe.in");
ofstream g("fructe.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>p;
f>>b;
do
{
ok=0;
if(p>0 & b!=0)
p=0;
if(p==0 && b!=1)
{
b-=2;
p++;
}
if(p==1 && b==0)
ok=1;
if(p==0 && b==1)
ok=1;
}while(ok==0);
if(p==1)
g<<"0";
if(i!=n && p==1)
g<<endl;
if(b==1)
g<<"1";
if(i!=n && b==1)
g<<endl;
}
f.close();
g.close();
return 0;
}