# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
148384 | (대충 적당한 팀명) (#200) | FunctionCup Museum (FXCUP4_museum) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "museum.h"
long long CountSimilarPairs(std::vector<int> B, std::vector<int> T, std::vector<int> G) {
int N = B.size();
int check
int ans = 0;
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
if(B[i] == B[j]){
ans++;
continue;
}
if(T[i] == T[j]){
ans++;
continue;
}
if(G[i] == G[j]){
ans++;
continue;
}
}
}
return ans;
}