Pagini recente » Cod sursa (job #2848749) | Cod sursa (job #1985792) | Cod sursa (job #2008269) | Cod sursa (job #1504171) | Cod sursa (job #2014149)
#include <bits/stdc++.h>
using namespace std;
ifstream f("amlei.in");
ofstream g("amlei.out");
int n,a,b,i,j,k;
long long A[1<<9],B[1<<9];
void read(long long A[],int a)
{
for(i=0;i<a;++i)
for(j=A[i]=0;j<n;++j) {
f>>k;
if(k>0)
A[i]|=1<<k;
}
}
/*
void read(long long A[],int a)
{
for(i=0;i<a;++i)
for(j=A[i]=0;j<n;++j) {
f>>k;
if(k>0)
A[i]|=1<<k;
}
}
*/
int main()
{
while(f>>n>>a>>b) {
read(A,a);
read(B,b);
sort(A,A+a);
sort(B,B+b);
for(i=0;i<a;++i)
if(!binary_search(B,B+b,A[i])) break;
g<<(i<a?"NU\n":"DA\n");
}
return 0;
}