Pagini recente » Cod sursa (job #1901616) | Monitorul de evaluare | Cod sursa (job #1880657) | Cod sursa (job #3335963) | Cod sursa (job #3329545)
#include <fstream>
#include <vector>
using namespace std;
ifstream be("sortaret.in");
ofstream ki("sortaret.out");
void dfs(vector<vector<int>> &g, vector<char> &vis, vector<int> &ans, int x)
{
ans.push_back(x);
vis[x] = 1;
for(int i : g[x])
{
if(!vis[i])
{
dfs(g, vis, ans, i);
}
}
}
int main()
{
int n, m;
be >> n >> m;
vector<vector<int>> g(n + 1);
for(int i = 0; i < m; i++)
{
int x, y;
be >> x >> y;
g[x].push_back(y);
}
vector<int> ans;
vector<char> vis(n + 1);
for(int i = 1; i <= n; i++)
{
if(!vis[i])
{
dfs(g, vis, ans, i);
}
}
for(int i : ans)
{
ki << i << " ";
}
return 0;
}