Pagini recente » Cod sursa (job #2825662) | Cod sursa (job #719107) | Cod sursa (job #690962) | Borderou de evaluare (job #2632912) | Cod sursa (job #3215107)
#include <iostream>
using namespace std;
int n, C[501], m, op, x, y;
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; ++i)
C[i] = i;
for(int i = 1; i <= m; ++i) {
cin >> op >> x >> y;
if(op == 1) {
if(C[x] < C[y]) {
int cy = C[y];
for(int j = 1; j <= n; ++j)
if(C[j] == cy)
C[j] = C[x];
}
else {
int cx = C[x];
for(int j = 1; j <= n; ++j)
if(C[j] == cx)
C[j] = C[y];
}
}
else
{
if(C[x]== C[y])
cout<<"DA\n";
else
cout<<"NU\n";
}
}
return 0;
}