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
拓扑排序的一道题,给你n个任务m个关系,然后下面的m行都是告诉你,做事情的先后顺序。然后你裸的用拓扑一下就可以。
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int n,m,book[1010][1010];
struct node
{
int x,y;
}s[1010];
int main()
{
while(~scanf("%d%d",&n,&m)&&n+m)
{
int l=0,i,j,k,a,b;
memset(s,0,sizeof(s));
memset(book,0,sizeof(book));
for(i=1; i<=m; i++)
{
scanf("%d%d",&a,&b);
if(book[a][b]==0)
{
book[a][b]=1;
s[b].x++;
}
}
for(i=0; i<n; i++)
{
for(j=1; j<=n; j++)
{
if(s[j].x==0)
{
k=j;
break;
}
}
s[l++].y=k;
s[k].x=-1;
for(j=1; j<=n; j++)
{
if(book[k][j]==1)
s[j].x--;
}
}
for(i=0; i<l; i++)
{
if(i!=l-1)
printf("%d ",s[i].y);
else
printf("%d\n",s[i].y);
}
}
return 0;
}