Submission #3405042


Source Code Expand

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
#include<cmath>
#include<numeric>
#include<vector>
#include<tuple>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define vint vector<int> 
#define vvint vector<vint>
#define ct(a) cout<<a<<endl
typedef long long ll;
const int MOD = 1e9 + 7;
ll N, K;
bool d[10];

int main(void)
{
	cin >> N >> K;
	ll ans = 100000;
	FOR(i, 0, K) {
		int u;cin >> u;d[u] = true;
	}
	FOR(i, N, 100000) {
		bool flag=false; int k = i;
		while (k > 0) {
			if(d[k % 10] == true)flag=true;
			k /= 10;
		}
		if (!flag) {
			ans = i;
			break;
		}
	}
	ct(ans);

	return 0;
}

Submission Info

Submission Time
Task C - Iroha's Obsession
User pnnc205j
Language C++14 (GCC 5.4.1)
Score 300
Code Size 700 Byte
Status AC
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status AC
AC × 10
Set Name Test Cases
Sample
All 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 AC 1 ms 256 KB
subtask0_sample_02.txt AC 1 ms 256 KB
subtask1_X_01.txt AC 1 ms 256 KB
subtask1_X_02.txt AC 2 ms 256 KB
subtask1_X_03.txt AC 1 ms 256 KB
subtask1_X_04.txt AC 1 ms 256 KB
subtask1_X_05.txt AC 1 ms 256 KB
subtask1_X_06.txt AC 1 ms 256 KB
subtask1_X_07.txt AC 1 ms 256 KB
subtask1_X_08.txt AC 1 ms 256 KB