제출 #107672

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
107672		dfistric	Sequence (BOI14_sequence)	C++14	9 / 100	14 ms	768 KiB

sequence

#include <bits/stdc++.h>

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) FOR(i, 0, n)
#define ll long long

using namespace std;

const int MAXN = 100100;
ll arr[MAXN];

int main() {
    ios_base::sync_with_stdio(false);
 
    int n;
    cin >> n;
    REP(i, n) cin >> arr[i];

    if (n <= 1000) {
        REP(k, 1001) {
            int good = 1;
            REP(i, n) {
                int flag = 0, t = k + i;
                while (t > 0) {
                    if (t % 10 == arr[i]) flag = 1;
                    t /= 10;
                }
     
                if (!flag) good = 0;
            }
            if (good) {
                cout << k << "\n";
                return 0;
            }
        }
    }

    if (arr[0] != 9) {
        n--;
        int t = 1;
        while (t < n) t *= 10;

        if (arr[0] == 0) cout << 10 * t << "\n";
        else             cout << arr[0] * t << "\n";
    } else {
        int out = 8, curr = 1, inc = 10;
        while (curr < n) {
            curr += inc;
            out = out * 10 + 8;
            inc *= 10;
        }
        cout << out + 1 << "\n";
    }

    return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 33
• Subtask 3: 0 / 25
• Subtask 4: 0 / 33