Cod sursa(job #632172)
Utilizator | Data | 10 noiembrie 2011 14:46:32 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
using namespace std;
int main()
{
int n,m,v[1000],c[1000],i,op[100];
ifstream f("disjoint.in");
ofstream g("disjoint.out");
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>op[i];
f>>v[i]>>c[i];
}
for(i=1;i<=m;i++)
{
if(op[i]==1)
c[i]=v[i];
else
if(v[i]!=c[i])
g<<"NU\n";
else
g<<"DA\n";
}
/*
for(i=1;i<=m;i++)
g<<c[i]<<" ";
*/
return 0;
}