# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
527665 | theshadow_04 | Beautiful row (IZhO12_beauty) | C++14 | 9 ms | 3420 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.
// annotshy
#include <bits/stdc++.h>
#define Task "beauty"
#define F first
#define S second
using namespace std;
const int maxn = 100005;
int n, a[maxn];
long long dp[(1 << 20) + 5][25], match[25][25];
int binary_1(int x) {
int res = 0;
while(x) {
res += (x % 2 == 1);
x /= 2;
}
return res;
}
int ternary_1(int x) {
int res = 0;
while(x) {
res += (x % 3 == 1);
x /= 3;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |