Submission #1868700
Source Code Expand
#include<bits/stdc++.h> #define r(i,n) for(int i=0;i<n;i++) using namespace std; bool used[50]; typedef pair<int,int>P; int n,k,a[11]; void dfs(int d){ } int main(){ cin>>n>>k; set<int>st; r(i,k)cin>>a[i],st.insert(a[i]); for(int i=n;;i++){ int c=i,f=0; while(c){ if(st.count(c%10))f++; c/=10; } if(!f){ cout<<i<<endl; return 0; } } }
Submission Info
Submission Time | |
---|---|
Task | C - Iroha's Obsession |
User | c7c7 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 411 Byte |
Status | AC |
Exec Time | 7 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 | 7 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 | 2 ms | 256 KB |
subtask1_X_07.txt | AC | 1 ms | 256 KB |
subtask1_X_08.txt | AC | 1 ms | 256 KB |