Sislovesme - 412.

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

Memory – The array love[1…N] is stored: . 412. Sislovesme

Multiple test cases are given. T // number of test cases (1 ≤ T ≤ 20) N // number of people (1 ≤ N ≤ 10^5) love[1] love[2] … love[N] // N integers, 1 ≤ love[i] ≤ N The sum of N over all test cases does not exceed 10^6 . Output For each test case output a single line containing the number of mutual‑love pairs. Sample Input 2 4 2 1 4 3 5 2

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

Memory – The array love[1…N] is stored: .

Multiple test cases are given. T // number of test cases (1 ≤ T ≤ 20) N // number of people (1 ≤ N ≤ 10^5) love[1] love[2] … love[N] // N integers, 1 ≤ love[i] ≤ N The sum of N over all test cases does not exceed 10^6 . Output For each test case output a single line containing the number of mutual‑love pairs. Sample Input