Submission #4648104
Source Code Expand
#include <bits/stdc++.h> using namespace std; int X,N,D[10]; bool calc(int n){ for(int i=0;i<N;i++){//一の位の値がないときture if(n%10==D[i])return false; //cout<<i; } return true; } int judge(int n){ while (calc(n)) { n/=10; if(n==0)return 0;//ok } //cout<<n<<"\n"; return n;//NG } int main() { int i,n; cin>>X>>N; for(i=0;i<N;i++){ cin>>D[i]; } D[i]=10; while((judge(X))!=0)X++; cout<<X; }
Submission Info
Submission Time | |
---|---|
Task | C - Iroha's Obsession |
User | gare |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 499 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 |
|
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 |