Pagini recente » Cod sursa (job #3202953) | Cod sursa (job #2991119) | Cod sursa (job #906856) | Cod sursa (job #2775219) | Cod sursa (job #18244)
Cod sursa(job #18244)
#include<fstream.h>
ifstream f("amlei.in");
ofstream g("amlei.out");
int n,t,u,w;
int solv()
{int i,j,ok1=1,ok2=0,tt,uu,x,ok3=0;
for(i=1;i<=t;i++)
{ok1=1;
for(j=1;j<=n;j++)
{f>>x;
if(x<0) {ok1=0;break;}
}
if(ok1) {ok2=1;break;}
else
{j++;
while(j<=n) {f>>x;j++;}
}
}
if(ok2)
{tt=t*n;
i=i*n+1;
while(i<=tt)
{f>>x;i++;}
}
ok3=0;
for(i=1;i<=u;i++)
{ok1=1;
for(j=1;j<=n;j++)
{f>>x;
if(x<0) {ok1=0;break;}
}
if(ok1) {ok3=1;break;}
else
{j++;
while(j<=n) {f>>x;j++;}
}
}
if(ok3)
{uu=u*n;
i=i*n+1;
while(i<=uu)
{f>>x;i++;}
}
return ok2==ok3;
}
int main()
{
while(f>>n>>t>>u)
{if(solv()) g<<"DA"<<'\n';
else g<<"NU"<<'\n';
}
f.close();
g.close();
return 0;
}