Cod sursa(job #19249)
Utilizator | Catalin Tiseanu Zeus | Data | 18 februarie 2007 23:46:01 |
---|---|---|---|
Problema | Amlei | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 1.22 kb |
using namespace std;
#include <cstdio>
#include <set>
int main()
{
freopen("amlei.in", "r", stdin);
freopen("amlei.out", "w", stdout);
int W, t, u, n, x;
for(;;)
{
if( scanf("%d %d %d ", &n, &u, &t) == EOF )
break;
set<long long> s1, s2;
long long m;
for( ; u--; )
{
m = 0;
for( int i = 0; i < n; i++ )
{
scanf("%d", &x);
if( x > 0 )
{
x--;
m += (1LL<<x);
}
}
s1.insert( m );
}
for( ; t--; )
{
m = 0;
for( int i = 0; i < n; i++ )
{
scanf("%d", &x);
if( x > 0 )
{
x--;
m += (1LL<<x);
}
}
s2.insert( m );
}
if( s1 == s2 )
printf("DA\n");
else
printf("NU\n");
}
return 0;
}