Cod sursa(job #1610742)
Utilizator | Data | 23 februarie 2016 18:32:36 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <cstdio>
#include <vector>
#define nmax 50010
using namespace std;
int n,m1;
vector<int> m[nmax];
void solve(int nod)
{
cout<<nod<<' ';
for(vector<int>::iterator it=m[nod].begin();it!=m[nod].end();it++)
solve(*it);
}
int main()
{
freopen("sortaret.in","r",stdin);
//freopen("sortaret.out","w",stdout);
cin>>n>>m1;
int n1,n2;
for(;m1;m1--)
{
cin>>n1>>n2;
m[n1].push_back(n2);
}
solve(1);
fclose(stdin);
fclose(stdout);
return 0;
}