oj.uz

답안 #22616

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
22616 2017-04-30T05:58:23 Z 2000/4000(#946, 0xrgb) Fully Generate (KRIII5_FG) C++14
0 / 7
 0 ms 1504 KB 
#include <cstdio>

const int P = 1000'000'007;
int N;
int A[100004];

int main() {
	scanf("%d", &N);
	if (N > 1000000) {
		puts("Too Big!");
		return 0;
	}

	long long p = 1;
	A[1] = 1;
	for (int i = 1; i < N; ++i) {
		A[i + 1] = 1 + A[i + 1 - A[A[i]]];
		p = p * A[i + 1] % P;
	}

	printf("%lld\n", p);
	return 0;
}

Compilation message

FG.cpp: In function 'int main()':
FG.cpp:8:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1504 KB Output is correct
2 Correct 0 ms 1504 KB Output is correct
3 Correct 0 ms 1504 KB Output is correct
4 Correct 0 ms 1504 KB Output is correct
5 Correct 0 ms 1504 KB Output is correct
6 Correct 0 ms 1504 KB Output is correct
7 Correct 0 ms 1504 KB Output is correct
8 Correct 0 ms 1504 KB Output is correct
9 Correct 0 ms 1504 KB Output is correct
10 Correct 0 ms 1504 KB Output is correct
11 Runtime error 0 ms 1504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1504 KB Output is correct
2 Correct 0 ms 1504 KB Output is correct
3 Correct 0 ms 1504 KB Output is correct
4 Correct 0 ms 1504 KB Output is correct
5 Correct 0 ms 1504 KB Output is correct
6 Correct 0 ms 1504 KB Output is correct
7 Correct 0 ms 1504 KB Output is correct
8 Correct 0 ms 1504 KB Output is correct
9 Correct 0 ms 1504 KB Output is correct
10 Correct 0 ms 1504 KB Output is correct
11 Runtime error 0 ms 1504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -