Cod sursa(job #1483724)
Utilizator | Data | 9 septembrie 2015 20:13:50 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <cstdio>
#include <vector>
#define maxc 100005
using namespace std;
int n,m,op,h[maxc],x,y;
vector <int > G[maxc];
void rezolv()
{
scanf("%d%d",&n,&m);
for (int i=1; i<=m; ++i)
{
scanf("%d%d%d",&op,&x,&y);
if (op==1)
{
}
}
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
return 0;
}