Pagini recente » Cod sursa (job #583848) | Cod sursa (job #1285760) | Cod sursa (job #721141) | Cod sursa (job #202855) | Cod sursa (job #1087133)
#include <cstdio>
#include <vector>
#include <bitset>
std::vector<int> graph[100], sol;
std::bitset<100> vis;
void dfs(int start){
vis[start] = 1;
for (unsigned i=0; i<graph[start].size(); ++i){
if (!vis[graph[start][i]]){
dfs(graph[start][i]);
}
}
sol.push_back(start);
}
int main()
{
int N, M;
freopen("sortaret.in", "r", stdin);
freopen("sortaret.out", "w", stdout);
scanf("%d %d", &N, &M);
for (int i=0; i<M; ++i){
int x, y;
scanf("%d %d", &x, &y);
graph[x].push_back(y);
}
for (int i=1; i<=N; ++i){
if (!vis[i]){
dfs(i);
}
}
for (int i=sol.size()-1; i>=0; --i){
printf("%d ", sol[i]);
}
return 0;
}