# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
491905 | Hegdahl | Sequence (BOI14_sequence) | C++17 | 6 ms | 588 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 <algorithm>
#include <iostream>
#include <vector>
int brute(const std::vector<int> &a) {
int have_digit[10][2001];
for (int d = 0; d < 10; ++d)
for (int w = 1; w <= 2000; w *= 10)
for (int i = d*w; i <= 2000; i += 10*w)
for (int j = i; j < std::min(i+w, 2000); ++j)
have_digit[d][j] = 1;
int n = 0;
bool ok;
do {
++n;
ok = true;
for (int i = 0; i < (int)a.size(); ++i)
ok &= have_digit[a[i]][n+i];
} while (!ok);
return n;
}
int main() {
std::cin.tie(0)->sync_with_stdio(0);
int k;
std::cin >> k;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |