Submission #2638354

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))


int d[10];

bool ok(int x){
    while (x) {
        if (d[x%10]) return false;
        x /= 10;
    }
    return true;
}
int solve(int N){
    for (int x=N; x<=999999; ++x) {
        if (ok(x)) return x;
    }
}

int main() {
    int n,k; cin>>n>>k;
    mset(d, 0);
    rep(i,k) {
        int di; cin >> di;
        d[di] = 1;
    }
    cout<<solve(n)<<endl;
    return 0;
}

Submission Info

Submission Time
Task C - こだわり者いろはちゃん / Iroha's Obsession
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1477 Byte
Status
Exec Time 1 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0
All 300 / 300 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_X_01.txt, subtask1_X_02.txt, subtask1_X_03.txt, subtask1_X_04.txt, subtask1_X_05.txt, subtask1_X_06.txt, subtask1_X_07.txt, subtask1_X_08.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt 1 ms 256 KB
subtask0_sample_02.txt 1 ms 256 KB
subtask1_X_01.txt 1 ms 256 KB
subtask1_X_02.txt 1 ms 256 KB
subtask1_X_03.txt 1 ms 256 KB
subtask1_X_04.txt 1 ms 256 KB
subtask1_X_05.txt 1 ms 256 KB
subtask1_X_06.txt 1 ms 256 KB
subtask1_X_07.txt 1 ms 256 KB
subtask1_X_08.txt 1 ms 256 KB