Submission #3404934
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> typedef long long ll; const int MOD = 1e9 + 7; ll N, K; bool d[10]; int main(void) { cin >> N >> K; int ans = 10000; FOR(i, 0, K) { int u;cin >> u;d[u] = true; } FOR(i, N, 10001) { bool flag; int k = i; while (k > 0) { flag = (d[k % 10] == true); k /= 10; } if (!flag) { ans = i; break; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Iroha's Obsession |
User | pnnc205j |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 672 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||
Status | AC |
|
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 | WA | 1 ms | 256 KB |
subtask1_X_03.txt | AC | 1 ms | 256 KB |
subtask1_X_04.txt | WA | 1 ms | 256 KB |
subtask1_X_05.txt | AC | 1 ms | 256 KB |
subtask1_X_06.txt | WA | 1 ms | 256 KB |
subtask1_X_07.txt | WA | 1 ms | 256 KB |
subtask1_X_08.txt | AC | 1 ms | 256 KB |