Submission #4624311
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> #include<cmath> #include<map> using namespace std; using ll = long long; int main(){ ll n,k,d; bool nums[10]; for(int i=0;i<10;i++) nums[i] = false; cin >> n >> k; for(ll i=0;i<k;i++){ cin >> d; nums[d] = true; } for(int i=n;;i++){ bool flag = true; string str=to_string(i); for(int j=0;j<str.size();j++){ if(nums[str[j]-'0']==true){ flag=false; break; } } if(flag==true){ cout << i << endl; break; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Iroha's Obsession |
User | thash |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 691 Byte |
Status | AC |
Exec Time | 12 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||
---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | 2 ms | 256 KB |
subtask1_X_02.txt | AC | 12 ms | 256 KB |
subtask1_X_03.txt | AC | 2 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 | 2 ms | 256 KB |
subtask1_X_07.txt | AC | 1 ms | 256 KB |
subtask1_X_08.txt | AC | 1 ms | 256 KB |