Pagini recente » Cod sursa (job #2990647) | Cod sursa (job #2712241) | Cod sursa (job #3168467) | Cod sursa (job #3171735) | Cod sursa (job #1699899)
#include <iostream>
#include <fstream>
using namespace std;
int v[50001];
int o[50001];
int main()
{
ifstream fin ("sortaret.in");
ofstream gin ("sortaret.out");
int m,n,s[100001][2],i,j,ord=1,t;
fin >> n >> m;
for (i=0;i<m;i++)
{
fin >> s[i][0] >> s[i][1];
t=s[i][1];
v[t]++;
}
while (ord<=n)
{
for (i=1;i<=n;i++)
{
if (v[i]==0)
{o[ord]=i;
v[i]=-1;
ord++;
for (j=0;j<m;j++)
{
if (s[j][0]==i)
v[s[j][1]]--;
}
}
}
}
for (i=1;i<=n;i++)
gin << o[i] << " ";
return 0;
}