Problem F
Ordering Tasks
Input:standard input
Output:standard output
Time Limit:1second
Memory Limit:32 MB
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 <= 100andm.nis the number of tasks (numbered from1ton) andmis the number of direct precedence relations between tasks. After this, there will bemlines with two integersiandj, representing the fact that taskimust be executed before taskj. An instance withn = m = 0will finish the input.
Output
For each instance, print a line withnintegers representing the tasks in a possible order of execution.Sample Input5 41 22 31 31 50 0Sample Output1 4 2 5 3
(The Joint Effort Contest, Problem setter: RodrigoMaltaSchmidt)
懒得说题意了，就是注意，，输出的数据可能和所给的事例不一样，只要符合其中一种就好。
#include <stdio.h>#include <string.h>#include <stdlib.h>#include <iostream>#include <algorithm>#include <set>#include <queue>#include <stack>using namespace std;int n,m,i,j,k,u,v;int map[110][110];int ans[110];int in[110];int topo(){for(i=1;i<=n;i++){k=1;while(in[k])k++;ans[i]=k;in[k]=-1;for(j=1;j<=n;j++)if(map[k][j])in[j]–;}}int main(){while(~scanf("%d %d",&n,&m)){if(n==0&&m==0) break;memset(map,0,sizeof(map));memset(in,0,sizeof(in));memset(ans,0,sizeof(ans));for(i=1;i<=m;i++){scanf("%d %d",&u,&v);if(map[u][v]==0){map[u][v]=1;in[v]++;}}topo();for(i=1;i<n;i++)printf("%d ",ans[i]);printf("%d\n",ans[i]);}return 0;}
一个人目睹沿途的风景，拿着相机，拍下沿途上的风景，
