Cod sursa(job #542351)
Utilizator | Data | 26 februarie 2011 12:13:45 | |
---|---|---|---|
Problema | Gossips | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Romanian Master in Mathematics and Sciences 2011, Ziua 2 | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
#include <vector>
#define DN 100005
using namespace std;
int rang[DN][DN],pre[DN],n,m,q;
vector<int> gr[DN];
int find(int el) {
int i;
for(i=el;i!=pre[i];i=pre[i]);
return i;
}
int main()
{
ifstream f("gossips.in");
ofstream g("gossips.out");
f>>n>>m>>q;
return 0;
}