Cod sursa(job #253656)
Utilizator | Data | 6 februarie 2009 10:18:12 | |
---|---|---|---|
Problema | Ciclu Eulerian | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
#include<vector>
#define MAXN 100009
using namespace std;
int n, m;
vector<int> G[MAXN];
int main(){
int i, x, y;
ifstream f("ciclueuler.in");
f>>n>>m;
for(i=0;i<m;i++){
f>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
f.close();
ofstream g("ciclueuler.out");
for(i=1;i<=n;i++)
if(((G[i].size())&1)){
g<<"-1\n";
g.close();
return 0;
}
return 0;
}