Pagini recente » Cod sursa (job #2021094) | Cod sursa (job #1134239) | Cod sursa (job #1549056) | Cod sursa (job #173743) | Cod sursa (job #2458051)
#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
#define limit 50100
using namespace std;
int n,m,a,b;
vector <int>G[limit];
int k=0;
int grad[limit]{};
int solutie[limit]{};
void citire(){
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>a>>b;
G[a].push_back(b);
grad[b]++;
}
}
void sortarerecursiva(int a){
solutie[++k]=a;
int x=G[a].size();
for(int j=0;j<x;j++){
grad[G[a][j]]--;
if(grad[G[a][j]]==0){
sortarerecursiva(G[a][j]);
}
}
}
int main()
{
freopen("sortaret.in", "rt", stdin);
freopen("sortaret.out", "wt", stdout);citire();
int x=0;
for(int i=1;i<=n;i++){
if(grad[i]==0){
x=i;
}
}
sortarerecursiva(x);
for(int i=1;i<=n;i++){
cout<<solutie[i]<<" ";
}
return 0;
}