Pagini recente » Cod sursa (job #2793106) | Cod sursa (job #616889) | Cod sursa (job #1544066) | Cod sursa (job #879008) | Cod sursa (job #1934660)
#include <bits/stdc++.h>
using namespace std;
int n, t, u;
struct State {
set<vector<int> > s;
void read(int n, int t) {
int i, j;
s.clear();
vector<int> v;
for (i = 1; i <= t; i++) {
v.clear();
for (j = 1; j <= n; j++) {
int x;
scanf("%d ", &x);
if (x > 0)
v.push_back(x);
}
sort(v.begin(), v.end());
s.insert(v);
}
}
};
int main() {
freopen("amlei.in", "r", stdin);
freopen("amlei.out", "w", stdout);
while(scanf("%d %d %d", &n, &t, &u) == 3) {
State x, y;
x.read(n, t);
y.read(n, u);
if(x.s == y.s)
printf("DA\n");
else
printf("NU\n");
}
}