Pagini recente » Borderou de evaluare (job #2437434) | Borderou de evaluare (job #1045943) | Borderou de evaluare (job #1865850) | Borderou de evaluare (job #2893002) | Cod sursa (job #646160)
Cod sursa(job #646160)
#include <stdio.h>
int main(void) {
int n, t, u;
unsigned int i, j;
unsigned long long sum1, sum2;
freopen("amlei.in", "r", stdin);
freopen("amlei.out", "w", stdout);
while (!feof(stdin)) {
sum1 = sum2 = 0;
if (3 != scanf("%d %d %d\n", &n, &t, &u))
break;
for (i = 0 ; i < t ; i++) {
unsigned long long sum = 0;
int tmp;
scanf("%d", &tmp);
if (tmp > 0)
sum = (1 << tmp);
for (j = 1 ; j < n ; j++) {
scanf("%d", &tmp);
if (tmp > 0)
sum &= (1 << tmp);
else
sum &= ~(1 << (-tmp));
}
sum1 |= sum;
}
for (i = 0 ; i < u ; i++) {
unsigned long long sum = 0;
int tmp;
scanf("%d", &tmp);
if (tmp > 0)
sum = (1 << tmp);
for (j = 1 ; j < n ; j++) {
scanf("%d", &tmp);
if (tmp > 0)
sum &= (1 << tmp);
else
sum &= ~(1 << (-tmp));
}
sum2 |= sum;
}
if (sum1 == sum2)
printf("DA\n");
else
printf("NU\n");
}
return 0;
}