Submission #14298

#TimeUsernameProblemLanguageResultExecution timeMemory
14298jalmal이상한 수열 (OJUZ10_bizarre)C++98
24 / 100
13 ms12800 KiB
#include <stdio.h> int N, M, chk[3000010], cnt; int main() { //freopen("input.txt", "r", stdin); int i, j; scanf("%d", &N); for(i = 1; i <= N; i ++) { int inp; scanf("%d", &inp); if(!chk[inp + 1000000]) cnt ++, chk[inp + 1000000] = 1; } scanf("%d", &M); for(i = N+1; i <= M; i ++) { if(chk[cnt + 1000000]) { printf("%d\n", cnt); return 0; } chk[cnt + 1000000] = 1; cnt ++; } printf("%d\n", --cnt); 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...