Cod sursa(job #18393)
| Utilizator | Data | 18 februarie 2007 11:55:03 | |
|---|---|---|---|
| Problema | Amlei | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | preONI 2007, Runda 2, Clasa a 9-a si gimnaziu | Marime | 0.94 kb |
#include<fstream>
using namespace std;
int a[110],b[110],n,t,u;
int main()
{
ifstream in("amlei.in");
int ok,i,x;
ofstream out("amlei.out");
while(in>>n>>t>>u)
{
for (i=0;i<=100;i++)
a[i]=b[i]=0;
for (i=1;i<=n*t;i++)
{
in>>x;
a[x+50]=1;
}
for (i=1;i<=n*u;i++)
{
in>>x;
b[x+50]=1;
}
ok=1;
for (i=0;i<=100;i++)
if (a[i]!=b[100-i])
{
ok=0;
break;
}
if (ok)
out<<"DA"<<"\n";
else
out<<"NU"<<"\n";
}
in.close();
out.close();
return 0;
}
