Pagini recente » Cod sursa (job #934163) | Cod sursa (job #796437) | Cod sursa (job #527960) | Cod sursa (job #730570) | Cod sursa (job #476246)
Cod sursa(job #476246)
#include<cstdio>
#include<vector>
using namespace std;
const int N=50001;
vector <int> g[N];
int n, ts[N], p;
bool viz[N];
void Read()
{
int m;
scanf( "%d%d",&n,&m);
int a, b;
for( int i=1; i<=m; ++i)
{
scanf( "%d%d", &a, &b);
g[a].push_back(b);
}
}
void Df(int i)
{
int aux;
viz[i]=1;
int sz=g[i].size();
for( int j=0; j<sz; ++j)
{
aux=g[i][j];
if(!viz[aux])
Df(aux);
}
ts[++p]=i;
}
void Solve()
{
for( int i=1; i<=n; ++i)
if(!viz[i])
Df(i);
}
void Print()
{
for( int i=n; i; --i)
printf( "%d ", ts[i]);
}
int main()
{
freopen( "sortaret.in", "r", stdin);
freopen( "sortaret.out", "w", stdout);
Read();
Solve();
Print();
return 0;
}