Cod sursa(job #632176)
Utilizator | Data | 10 noiembrie 2011 14:54:22 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream.h>
#include <vector.h>
#include <fstream>
int main()
int v[100002],tata[100],n,m,i;
{
fstream fin("disjoint.in")
ofstream fout("disjoint.out")
f>>n>>m;
f.close();
for(i=1;i<=n;i++)
{
if(tata[n]>tata[n+1]&&n=n+1)
cout<<DA;
else
cout<<NU;
}
system ("pause");
return 0;
}