拓扑

John has n tasks to do. Unfortunately, the tasks are not independent and the execution of one task is only possible if other tasks have already been executed.
Input
The input will consist of several instances of the problem. Each instance begins with a line containing two integers, 1 ≤ n ≤ 100 and m. n is the number of tasks (numbered from 1 to n) and m is the number of direct precedence relations between tasks. After this, there will be m lines with two integers i and j, representing the fact that task i must be executed before task j. An instance with n = m = 0 will finish the input.
Output
For each instance, print a line with n integers representing the tasks in a possible order of execution.
Sample Input
5 4
1 2
2 3
1 3
1 5
0 0
Sample Output
1 4 2 5 3

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int tp[100100];
int e[110][110];
int by[11010],n,m;
void xia()
{
 for(int i=1;i<=n;i++)
 {
  int k=1;
  while(by[k])
   k++;
  tp[i]=k;
  by[k]=-1;
  for(int j=1;j<=n;j++)
   if(e[k][j])
    by[j]--;
 }
}
int main()
{
 while(cin>>n>>m&&(n+m))
 {
  memset(tp,0,sizeof(tp));
  memset(e,0,sizeof(e));
  memset(by,0,sizeof(by));
  for(int i=0;i<m;i++)
  {
   int a,b;
   cin>>a>>b;
   if(!e[a][b])
   {
    e[a][b]=1;
    by[b]++;
   }
  }
  xia();
  for(int i=1;i<n;i++)
  printf("%d ",tp[i]);
  printf("%d\n",tp[n]); 
 }
}
/*
5 4
1 2
2 3
1 3
1 5
0 0
*/