| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 41359 | gabrielsimoes | Sequence (BOI14_sequence) | C++14 | 673 ms | 1256 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;
bool test(int a, int b) {
  while (a > 0) {
    if (b == (a % 10))
      return true;
    else
      a /= 10;
  }
  return false;
}
int n;
vector<int> v;
int main() {
  scanf("%d", &n);
  for (int i = 0, a; i < n; i++) {
    scanf("%d", &a);
    v.push_back(a);
  }
  if (n <= 10000) {
    for (int ans = 1; ans <= 10000; ans++) {
      bool ok = true;
      for (int i = 0; i < n; i++) {
        if (!test(ans + i, v[i])) ok = false;
      }
      if (ok) {
        printf("%d\n", ans);
        return 0;
      }
    }
  }
  int x = v[0];
  if (x > 0 && x < 9) {
    printf("%d", x);
    int cur = 1;
    while (n >= cur + 1) {
      printf("0");
      cur *= 10;
    }
    printf("\n");
  }
  if (x == 9) {
    int cur = 1;
    while (n >= cur + 1) {
      printf("8");
      cur = cur * 10 + 1;
    }
    printf("9\n");
  }
  if (x == 0) {
    printf("10");
    if (n != 1) {
      int cur = 1;
      while (n > cur) {
        printf("0");
        cur = cur * 10 + 1;
      }
    }
    printf("\n");
  }
}
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... | ||||
