oj.uz

Submission #118541

# Submission time Handle Problem Language Result Execution time Memory
118541 2019-06-19T07:55:01 Z 임유진(#2901) Sequence (BOI14_sequence) C++14
9 / 100
 17 ms 512 KB 
#include<stdio.h>

#define MAXN 1000

int B[MAXN];

int main(){
	int K;
	
	scanf("%d", &K);
	for(int i=0; i<K; i++) scanf("%d", B+i);

	for(int i=1; i<=1000; i++){
		bool a=true;
		for(int j=0; j<K; j++){
			bool b=false;
			for(int k=1; k<=i+j; k*=10) if(((i+j)/k)%10==B[j]){
				b=true;
			}
			if(!b) a=false;
		}
		if(a){
			printf("%d\n", i);
			return 0;
		}
	}
	return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &K);
  ~~~~~^~~~~~~~~~
sequence.cpp:11:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0; i<K; i++) scanf("%d", B+i);
                         ~~~~~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 17 ms 512 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 17 ms 256 KB Output is correct
15 Correct 17 ms 384 KB Output is correct

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 356 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Incorrect 17 ms 256 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Execution timed out 2 ms 384 KB Time limit exceeded (wall clock)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Execution timed out 2 ms 356 KB Time limit exceeded (wall clock)
6 Halted 0 ms 0 KB -