#include "museum.h"
#include <vector>
#include <set>
using namespace std;
using ll = long long;
int arr1[101];
int arr2[101];
int arr3[101];
ll fac[101];
ll CountSimilarPairs(vector<int> B, vector<int> T, vector<int> G)
{
fac[0] = 1;
for (int i = 1; i < 101; i++)
fac[i] = fac[i - 1] * i;
ll ans = 0;
int n = (int)B.size();
for (int i = 0; i < n; i++)
arr1[B[i]]++;
for (int i = 0; i < n; i++)
arr2[T[i]]++;
for (int i = 0; i < n; i++)
arr3[G[i]]++;
for (int i = 0; i < n; i++)
{
ans += arr1[B[i]] - 1;
ans += arr2[T[i]] - 1;
ans += arr3[G[i]] - 1;
}
set<pair<int, int>> s;
for (int i = 0; i < n; i++)
s.insert({ B[i], T[i] });
ans -= n - (int)s.size();
s.clear();
for (int i = 0; i < n; i++)
s.insert({ G[i], T[i] });
ans -= n - (int)s.size();
s.clear();
for (int i = 0; i < n; i++)
s.insert({ B[i], G[i] });
ans -= n - (int)s.size();
/*set<pair<int, pair<int, int>>> s2;
for (int i = 0; i < n; i++)
s2.insert({ B[i], { T[i], G[i]} });
ans += fac[n - (int)s2.size() + 1] / 2;*/
return ans;
}
