URAL 1022 Genealogical Tree

#include <iostream>
using namespace std;
#include <vector>
#include <memory.h>
int n;
int topology[120][120];
vector<int> result;
bool zoro_out_degree(int index) {
//	bool flag = true;
for (int i = 1;i <= n; i++) {
if (topology[index][i]==1) {
//flag = false;
return false;
}
}
return true;
}
void delete_out_degree(int index) {
for (int i = 1; i <= n; i++)
topology[i][index]=0;
}
bool is_visited(int index) {
for (int i = 0; i < result.size(); i++) {
if (result[i]==index)
return true;
}
return false;
}
int main() {
int i;
int tmp;

while (cin >> n) {
result.clear();
for (i=1;i<=n;i++) {
cin >> tmp;
while (tmp!=0) {
topology[i][tmp]=1;
cin >> tmp;
}
}

while (result.size() < n) {
for (i=1;i<=n;i++) {
if (zoro_out_degree(i)==true&&is_visited(i)==false) {
result.push_back(i);
delete_out_degree(i);
}
}
}
for (i=result.size()-1;i>0;i--)
cout << result[i] << " ";
cout << result[0] << endl;
}
return 0;
}