Cod sursa(job #2394455)
Utilizator | Data | 1 aprilie 2019 17:08:26 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#include <map>
using namespace std;
map <int, int> p;
int main()
{
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int N,M,i,j;
fin>>N>>M;
for(i=1;i<=M;i++)
{
fin>>x>>y;
p[x]=1;
p[y]=1;
}
for(auto it:p[])
fin.close();
fout.close();
return 0;
}