DSA ka Saanp CP101

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define p_b pop_back
#define si stack<int>
#define sll stack<ll>
#define sc stack<char>
#define vi vector<int>
#define vll vector<ll>
#define mii map<int, int>
#define msi map<string, int>
#define mci map<char, int>
#define qc queue<char>
#define qi queue<int>
#define qll queue<ll>
using namespace std;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin >> t;
    while(t--){
        long n;
        cin >> n;

        map<ll, ll> m;
        for(int i = 0; i < n; i++){
            ll x;
            cin >> x;
            m[i+1] = x;
        }

        ll sum = 0;
        long i = 0;
        set<set<ll>> p;
        while(i < n){
            set<ll> s;
            int count = 1;
            bool f = true;
            int x = m[i+1];
            s.insert(x);
            while(m[x] != m[i+1]){
                s.insert(m[x]);
                x = m[x];
                count++;
                if(count > 3){
                    break;
                }
            }

            if(count == 3){
                p.insert(s);
            }


            i++;
        }

        cout << p.size() << "\n";
    }
    return 0;
}