Pagini recente » Cod sursa (job #1183674) | Cod sursa (job #1139078) | Cod sursa (job #182653) | Cod sursa (job #171482) | Cod sursa (job #2077257)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,gr[50001],k=0,x;
struct grad
{
int a,b;
}v[100000];
int main()
{
int q[50001];
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>v[i].a>>v[i].b;
gr[v[i].b]++;
}
for(int i=1;i<=n;i++)
{
if(gr[i]==0)
{
k++;
q[k]=i;
}
}
for(int i=1;i<=n;i++)
{
x=q[i];
for(int j=1;j<=m;j++)
{
if(v[j].a==x)
{
gr[v[j].b]=gr[v[j].b]-1;
if(gr[v[j].b]==0)
{
k++;
q[k]=v[j].b;
}
}
}
}
for(int i=1;i<=n;i++)
g<<q[i]<<" ";
f.close();
g.close();
return 0;
}