# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90105 | YottaByte | Beautiful row (IZhO12_beauty) | C++14 | 2 ms | 256 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 <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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |