Codeforces Round #595 (Div. 3) Books Exchange (easy version)

原题目：

The only difference between easy and hard versions is constraints.

There are nn kids, each of them is reading a unique book. At the end of any day, the i-th kid will give his book to the pi-th kid (in case of i=pi the kid will give his book to himself). It is guaranteed that all values of pipi are distinct integers from 1to nn (i.e. p is a permutation). The sequence pp doesn't change from day to day, it is fixed.

For example, if n=6 and p=[4,6,1,3,5,2] then at the end of the first day the book of the 1-st kid will belong to the 4-th kid, the 2-nd kid will belong to the 6-th kid and so on. At the end of the second day the book of the 1-st kid will belong to the 3-th kid, the 2-nd kid will belong to the 2-th kid and so on.

Your task is to determine the number of the day the book of the i-th child is returned back to him for the first time for every i from 1 to n.

Consider the following example: p=[5,1,2,4,3]. The book of the 1-st kid will be passed to the following kids:

after the 1-st day it will belong to the 5-th kid,
    after the 2-nd day it will belong to the 3-rd kid,
    after the 3-rd day it will belong to the 2-nd kid,
    after the 4-th day it will belong to the 1-st kid.
So after the fourth day, the book of the first kid will return to its owner. The book of the fourth kid will return to him for the first time after exactly one day.

You have to answer q independent queries.

Input

The first line of the input contains one integer q (1≤q≤200) — the number of queries. Then q queries follow.

The first line of the query contains one integer n (1≤n≤200) — the number of kids in the query. The second line of the query contains n integers p1,p2,…,pn (1≤pi≤n, all pi are distinct, i.e. p is a permutation), where pi is the kid which will get the book of the i-th kid.

 

Output

For each query, print the answer on it: n integers a1,a2,…,an, where aiai is the number of the day the book of the i-th child is returned back to him for the first time in this query.

输入：
6
5
1 2 3 4 5
3
2 3 1
6
4 6 2 1 5 3
1
1
4
3 4 1 2
5
5 1 2 4 3

输出：

1 1 1 1 1 
3 3 3 
2 3 3 2 1 3 
1 
2 2 2 2 
4 4 4 1 4 

中文概要：

给出t组数，每组给出n，表示接下有n本书，a[i]=k，表示第i个人需要把手上的书给第k个人，问编号为i的人手中的书回到自己的手中需要多少次。

#include<iostream>
using namespace std;
int a[220],w;
void dfs(int x,int k,int t)
{
     if(w)
         return;
     if(x==a[k])
     {
         w=t;
         return ;
     }
     dfs(x,a[k],t+1);
}
int main()
{
     int t,m;
     scanf("%d",&t);
     while(t--)
     {
         int n;
         scanf("%d",&n);
         for(int i=1;i<=n;i++)
             scanf("%d",&a[i]);
         for(int i=1;i<=n;i++)
         {
             w=0;
             dfs(i,i,1);
             printf("%d ",w);
         }
         printf("\n");
     }
     return 0;
 }

简单的递归：(中心思路）

void dfs(int x,int k,int t)//传入下标x，下标k，转手次数t
 {
     if(w)
         return;//剪枝
     if(x==a[k])//此时表示第x个人找到了对应a[k]=x的书
     {
         w=t;//定义w为全局变量，w=t，记录转手次数
         return ;
     }
     dfs(x,a[k],t+1);//否则还未找到，继续进行搜索
 }