Pagini recente » Cod sursa (job #273080) | Cod sursa (job #2376154) | Cod sursa (job #2245417) | Cod sursa (job #2985345) | Cod sursa (job #1603029)
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <bitset>
#define NMAX 50005
using namespace std;
int n, m;
vector<int> v[NMAX], sol;
bitset<NMAX> viz;
void readData(){
int x, y;
scanf("%d %d\n", &n, &m);
for (int i = 1; i <= m; ++i){
scanf("%d %d\n", &x, &y);
v[x].push_back(y);
}
}
void dfs(int x){
for (vector<int>::iterator it = v[x].begin(); it != v[x].end(); ++it){
if (!viz[*it]){
viz[*it] = 1;
dfs(*it);
}
}
sol.push_back(x);
}
void printData(){
for (int i = sol.size()-1; i >= 0; --i)
printf("%d ", sol[i]);
}
int main()
{
freopen("sortaret.in", "r", stdin);
freopen("sortaret.out", "w", stdout);
readData();
for (int i = 1; i <= n; ++i){
if (!viz[i]){
viz[i] = 1;
dfs(i);
}
}
printData();
return 0;
}