Pagini recente » Cod sursa (job #692519) | Cod sursa (job #1269790) | Cod sursa (job #2188649) | Cod sursa (job #1162805) | Cod sursa (job #1093433)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,viz[50002],sol[50001],val,x,y;
vector <int> v[50001];
void sortdfs(int k)
{
int j;
viz[k]=1;
for (j=0;j<v[k].size();j++)
if (!viz[v[k][j]]) sortdfs(v[k][j]);
sol[++val]=k;
}
int main ()
{
int i;
f>>n>>m;
for (i=1;i<=n;i++)
{
f>>x>>y;
v[x].push_back(y);
}
for (i=1;i<=n;i++)
if (!viz[i]) sortdfs(i);
for (i=n;i>=1;i--)
g<<sol[i]<<" ";
}