Pagini recente » Istoria paginii runda/335900 | Cod sursa (job #2809263) | Cod sursa (job #1776012) | Cod sursa (job #1194820) | Cod sursa (job #1863113)
#include <iostream>
#include <fstream>
using namespace std;
int z[50001];
int main()
{
ifstream cin ("sortaret.in");
ofstream cout ("sortaret.out");
int n,m,a[100001][3],i,j,nr=0;
cin>>n;
cin>>m;
for (i=1;i<=m;i++)
for (j=1;j<=2;j++)
{
cin>>a[i][j];
if (j==2)
z[a[i][j]]++;
}
// for(i=1;i<=n;i++) cout<<z[i]<<" "; cout<<"\n";
while(nr!=n)
{
for (i=1;i<=n;i++)
{
if (z[i]==0)
{
z[i]=-1;
cout<<i<<" ";
nr++;
}
for (j=1;j<=m;j++)
if (a[j][1]==i && z[a[j][2]]>0)
z[a[j][2]]--;
//cout<<z[i]<<" ";
}
}
return 0;
}