Cod sursa(job #2173885)
| Utilizator | Data | 16 martie 2018 09:23:31 | |
|---|---|---|---|
| Problema | Ciclu Eulerian | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <vector>
#include <bitset>
#define Nmax 100001
using namespace std;
ifstream fin ("ciclueuler.in");
ofstream fout ("ciclueuler.out");
int n, m, x, y;
vector < int > G[Nmax];
int main()
{
fin >> n >> m;
while (fin >> x >> y)
{
G[x].push_back(y);
G[y].push_back(x);
}
for (i = 1; i <= n; i ++)
{
if (G[i].size() % 2)
fout << -1;
}
fin.close();
fout.close();
return 0;
}
