#include<stdio.h>
#define BIGNUM 1000000007
int main(void)
{
FILE *fi = stdin;
long long sum = 0, num[110], start, temp, d, i, j;
fscanf(fi,"%lld",&d);
for(i = 0; i < d; i++)
fscanf(fi,"%lld",&num[i]);
start = 1;
temp = 2;
for(i = 0; i < d; i++)
num[i]--;
printf("1\n");
for(i = 1; i < d; i++)
{
sum = 0;
for(j = 1; j <= i; j++)
sum += num[j], sum %= BIGNUM;
printf("%lld\n",(start%BIGNUM+sum%BIGNUM+1%BIGNUM)%BIGNUM);
start += temp;
start %= BIGNUM;
temp *= (i+2);
temp %= BIGNUM;
for(j = 1; j <= i; j++)
num[j] *= (i+2), num[j] %= BIGNUM;
}
return 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 |