Pagini recente » Cod sursa (job #2195447) | Cod sursa (job #1993179) | Cod sursa (job #2299881) | Cod sursa (job #3138242) | Cod sursa (job #3213272)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int N=5e4+1;
vector<int> a[N];
int viz[N];
int l;
int v[N];
void f(int nod)
{
if(viz[nod]==1) ///graful are un ciclu
fout<<"NUH UH";
else
if(viz[nod]==0)
{
viz[nod]=1;
int k=a[nod].size();
for(int i=0;i<k;i++)
f(a[nod][i]);
viz[nod]=2;
l--;
v[l]=nod;
}
}
int main()
{
int n,m,i,x,y;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
a[x].push_back(y);
}
l=n+1;
for(i=1;i<=n;i++)
{
if(viz[i]==0)
{
f(i);
}
}
for(i=1;i<=n;i++)
fout<<v[i]<<" ";
return 0;
}