Description
The system of Martians' blood relations is confusing enough. Actually, Martians bud when they want and where they want. They gather together in different groups, so that a Martian can have one parent as well as ten. Nobody will be surprised by a hundred of children. Martians have got used to this and their style of life seems to them natural.Input
The first line of the standard input contains an only number N, 1 <= N <= 100 — a number of members of the Martian Planetary Council. According to the centuries-old tradition members of the Council are enumerated with the natural numbers from 1 up to N. Further, there are exactly N lines, moreover, the I-th line contains a list of I-th member's children. The list of children is a sequence of serial numbers of children in a arbitrary order separated by spaces. The list of children may be empty. The list (even if it is empty) ends with 0.Output
The standard output should contain in its only line a sequence of speakers' numbers, separated by spaces. If several sequences satisfy the conditions of the problem, you are to write to the standard output any of them. At least one such sequence always exists.Sample Input
5 0 4 5 1 0 1 0 5 3 0 3 0
Sample Output
2 4 5 3 1
Source
Ural State University Internal Contest October'2000 Junior Session
#include#include #include using namespace std; #define M 550 int mp[M][M],du[M],re[M]; int n,m; void topo(){ int t=0,i; queue q; for(i=1;i<=n;i++){ if(du[i]==0) q.push(i); } while(!q.empty()){ int s=q.front(); q.pop(); re[t++]=s; for(i=1;i<=n;i++){ if(mp[s][i] && --du[i]==0){ q.push(i); } } } printf("%d",re[0]); for(i=1;i