# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90105 | 2018-12-20T09:44:13 Z | YottaByte | Beautiful row (IZhO12_beauty) | C++14 | 2 ms | 256 KB |
#include <bits/stdc++.h> using namespace std; const int N = 20; int a[N + 1], n, ans, c2[N + 1], c3[N + 1]; inline int count(int a) { int res = 0; while(a) { res += (a % 3 == 1); a /= 3; } return res; } main() { cin >> n; for(int i = 1; i <= n; i++) { cin >> a[i]; c2[i] = __builtin_popcount(a[i]); c3[i] = count(a[i]); } for(int i = 1; i < n; i++) { for(int j = i + 1; j <= n; j++) if(c3[i] == c3[j]) ans++; } for(int i = 1; i < n; i++) { for(int j = i + 1; j <= n; j++) if(c2[i] == c2[j]) ans++; } cout << ans << endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |