# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105681 | luciocf | Sequence (BOI14_sequence) | C++14 | 366 ms | 768 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 maxn = 1e5+10;
int n;
int a[maxn];
int brute(void)
{
for (int j = 1; j <= 1000; j++)
{
int v = j;
bool deu = 1;
for (int i = 0; i < n; i++)
{
int aux = v;
bool ok = 0;
while (aux > 0)
{
if (aux%10 == a[i]) ok = 1;
aux /= 10;
}
if (!ok) deu = 0;
v++;
}
if (deu) return j;
}
return -1;
}
void solve_9(void)
{
if (n == 1)
{
printf("9\n");
return;
}
for (int i = 2; i <= 20; i++)
{
int x = 1;
for (int j = 1; j <= i; j++)
x *= 10;
x--; x /= 9;
if (x >= n)
{
for (int j = 1; j < i; j++)
printf("8");
printf("9\n");
return;
}
}
}
int main(void)
{
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
int first = a[0];
bool all = 1;
for (int i = 0; i < n; i++)
if (a[i] != first)
all = 0;
if (!all)
{
printf("%d\n", brute());
return 0;
}
if (a[0] == 9)
{
solve_9();
return 0;
}
int x = 1;
for (int i = 0; i <= 20; i++)
{
if (a[i] == 0)
{
int val = x*10-1;
val /= 9;
if (val >= n)
{
printf("10");
for (int j = 1; j <= i; j++) printf("0");
printf("\n");
return 0;
}
}
else if (x >= n)
{
printf("%d", a[0]);
for (int j = 1; j <= i; j++) printf("0");
printf("\n");
return 0;
}
x *= 10;
}
}
Compilation message (stderr)
# | 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... |