Pagini recente » Cod sursa (job #3266928) | Cod sursa (job #2805669) | Cod sursa (job #2042435) | Cod sursa (job #2490322) | Cod sursa (job #2425426)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int N, M;
struct graf
{
int c1,c2;
}g[100005];
int grade[50005];
int main()
{
fin>>N>>M;
for(int i=1;i<=M;i++)
{
fin>>g[i].c1>>g[i].c2;
grade[g[i].c2]++;
}
int coada[50005],pr=1,ul=1;
for(int i=1;i<=N;i++)
{
if(grade[i]==0)
{
coada[ul]=i;
ul++;
}
}
while(pr<ul)
{
for(int i=1;i<=M;i++)
{
if(g[i].c1==coada[pr])
{
grade[g[i].c2]--;
if(grade[g[i].c2]==0)
{
coada[ul]=g[i].c2;
ul++;
}
}
}
fout<<coada[pr]<<" ";
pr++;
}
return 0;
}