import sys
data = sys.stdin.read()
data_line = data.splitlines()
zero_line = int(data_line[0])
if zero_line == 0 or zero_line == "0":
sys.exit()
one_line = [int(x) for x in data_line[1].split()]
a_group = 0
final_group = []
group = one_line#one_line是最好朋友的列表
while group:
b_group = []
for i in range(zero_line):
b_group.append(one_line[a_group])#將one_group存進b_group
a_group = one_line[a_group]
pppas = one_line[a_group]
if b_group and pppas == b_group[0]:
break
final_group.append(b_group)
group = [x for x in group if x not in b_group]
if group != []:
a_group = group[0]
print(len(final_group))
我前九個都正確,最後一個卻錯了,也不可能時間過長啊?