Pagini recente » Cod sursa (job #519362) | Cod sursa (job #320395) | Cod sursa (job #2699361) | Borderou de evaluare (job #702965) | Cod sursa (job #2662481)
#include <fstream>
#include <vector>
std::ifstream fin("sortaret.in");
std::ofstream fout("sortaret.out");
int n,m,ts[50005],k;
bool use[50005];
std::vector<std::vector<int>> V;
void DFS(int N)
{
use[N]=1;
for(int i=0; i<(int)V[N].size(); i++)
{
if(!use[V[N][i]])
DFS(V[N][i]);
}
ts[++k]=N;
}
int main()
{
fin>>n>>m;
V.resize(n+5);
for(int i=1; i<=m; i++)
{
int x,y;
fin>>x>>y;
V[x].push_back(y);
}
for(int i=1; i<=n; i++)
if(!use[i])
DFS(i);
for(int i=n; i>=1; --i)
fout<<ts[i]<<" ";
return 0;
}