Codechef Starters 40 Division 3 (Unrated) Good Pairs Problem Code: XORR Solution

 

Problem Link:  https://www.codechef.com/START40C/problems/XORR

 Solution in C++: 

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

///**********ALLAH IS ALMIGHTY************///

#include <bits/stdc++.h>

using namespace std;

#define ll long long

int main()

{

    ll  t,n,i,j,ans,r;

    cin>>t;

    while(t--)

    {

        ans=0;

        cin>>n;

        ll a[n+9],b[n+9];

        for(i=0; i<n; i++)cin>>a[i];

        for(i=0; i<n; i++)cin>>b[i];

        map<ll,ll>mp;

        for(i=0; i<n; i++)

        {

            r=a[i]^b[i];

            ans+=mp[r];

            mp[r]++;

        }

        cout<<ans<<endl;

    }

}