Pagini recente » Cod sursa (job #2058757) | Cod sursa (job #2948745) | Cod sursa (job #2510091) | Cod sursa (job #2705743) | Cod sursa (job #2940114)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,i,j,k,x,b[50011],viz[50011],y;
vector<int>a[50011];
void dfs(int x)
{
int y=x;
viz[y]=1;
for(int j=0;j<a[y].size();j++)
if(viz[a[y][j]]==0)
dfs(a[y][j]);
viz[y]=2;
b[++k]=y;
}
void sortare()
{
for(int i=1;i<=n;i++)
if(viz[i]==0)
dfs(i);
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>x>>y;
a[x].push_back(y);
}
sortare();
for(int i=n;i>=1;i--)
g<<b[i]<<" ";
return 0;
}