Pagini recente » Borderou de evaluare (job #1007968) | Cod sursa (job #1705194) | Cod sursa (job #1231896) | Borderou de evaluare (job #194808) | Cod sursa (job #3237521)
#include <bits/stdc++.h>
using namespace std;
ifstream fin( "sortaret.in" );
ofstream fout( "sortaret.out" );
const int DIM = 50001;
vector<int> G[DIM];
int deg[DIM];
int main() {
ios_base::sync_with_stdio(0);
fin.tie(0);
int n, m, u, v;
fin >> n >> m;
while ( m-- ) {
fin >> u >> v;
G[u].push_back(v);
++deg[v];
}
queue<int> q;
for ( int i = 1; i <= n; ++i ) {
if ( deg[i] == 0 ) q.push(i);
}
while ( !q.empty() ) {
u = q.front();
q.pop();
for ( auto v : G[u] ) {
--deg[v];
if ( deg[v] == 0 ) {
q.push(v);
}
}
fout << u << " ";
}
fin.close();
fout.close();
return 0;
}