Pagini recente » Cod sursa (job #2720652) | Cod sursa (job #2112137) | Cod sursa (job #914984) | Cod sursa (job #2328141) | Cod sursa (job #1846961)
#include <cstdio>
#include <vector>
#define N 50001
using namespace std;
int n,gr[N];
vector <int> G[N];
bool elim[N];
void Read()
{
int m,x,y;
freopen("sortaret.in","r",stdin);
scanf("%d%d",&n,&m);
while (m--)
{
scanf("%d%d",&x,&y);
G[x].push_back(y);
gr[y]++;
}
}
void Sort()
{
int i,j;
bool done=0;
freopen("sortaret.out","w",stdout);
while (!done)
{
for (i=1,done=1;i<=n;++i)
if (!elim[i] && !gr[i])
{
elim[i]=1;done=0;
printf("%d ",i);
for (j=0;j<G[i].size();++j)
gr[G[i][j]]--;
}
}
}
int main()
{
Read();
Sort();
return 0;
}