Submission #41197

#TimeUsernameProblemLanguageResultExecution timeMemory
41197IvanCSequence (BOI14_sequence)C++14
34 / 100
1072 ms1924 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 10; int K,vetor[MAXN]; int check(int ini){ for(int i = ini,ptr = 1;ptr <= K;i++,ptr++){ if(i == 0 && vetor[ptr] == 0) continue; int copia = i; while(copia != 0 && copia % 10 != vetor[ptr]) copia /= 10; if(copia == 0) return 0; } return 1; } int main(){ cin >> K; for(int i = 1;i<=K;i++) cin >> vetor[i]; if(K <= 1000){ for(int i = 1;i<=1000000;i++){ if(check(i)){ cout << i << endl; return 0; } } } if(vetor[1] == 9){ int geratriz = 8; while(true){ if(check(geratriz + 1)){ cout << geratriz + 1 << endl; return 0; } geratriz *= 10; geratriz += 8; } } else if(vetor[1] == 0){ int ini = 1; while(true){ if(check(ini)){ cout << ini << endl; return 0; } ini *= 10; } } else{ int ini = vetor[1]; while(true){ if(check(ini)){ cout << ini << endl; return 0; } ini *= 10; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...