oj.uz

답안 #4122

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
4122 2013-09-01T17:00:49 Z jays Inherited disease (kriii1_I) C++
1 / 1
 0 ms 1088 KB 
#include <cstdio>

typedef long long ll;

const int MOD = 1000000007;
int D, c[101];

void solve() {
	ll left = 1, gen = 1, kth = 0;
	for (int i = 1; i <= D; ++i) {
		if (i == 1) {
			printf("%d\n", c[i-1]);
			continue;
		}
		left += gen; left %= MOD;
		gen *= i; gen %= MOD;
		kth *= i;
		kth += (c[i-1] - 1);
		kth %= MOD;
		printf("%lld\n", (left + kth) % MOD);
	}
}

int main() {
	scanf("%d", &D);
	for (int i = 0; i < D; ++i)
		scanf("%d", &c[i]);
	solve();
	return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Correct 0 ms 1088 KB Output is correct
3 Correct 0 ms 1088 KB Output is correct
4 Correct 0 ms 1088 KB Output is correct
5 Correct 0 ms 1088 KB Output is correct
6 Correct 0 ms 1088 KB Output is correct
7 Correct 0 ms 1088 KB Output is correct
8 Correct 0 ms 1088 KB Output is correct
9 Correct 0 ms 1088 KB Output is correct
10 Correct 0 ms 1088 KB Output is correct
11 Correct 0 ms 1088 KB Output is correct
12 Correct 0 ms 1088 KB Output is correct
13 Correct 0 ms 1088 KB Output is correct
14 Correct 0 ms 1088 KB Output is correct
15 Correct 0 ms 1088 KB Output is correct
16 Correct 0 ms 1088 KB Output is correct
17 Correct 0 ms 1088 KB Output is correct
18 Correct 0 ms 1088 KB Output is correct
19 Correct 0 ms 1088 KB Output is correct
20 Correct 0 ms 1088 KB Output is correct