#include <iostream>
#include <vector>
#define DIVIDENT 1000000007
using namespace std;
typedef long long int lld;
lld starting[110];
int main() {
starting[0]=0, starting[1]=1, starting[2]=2;
lld org=2;
for(int i=3; i<=100; ++i) {
starting[i]=(starting[i-1]+org)%DIVIDENT;
org=(org*i)%DIVIDENT;
}
// for(int i=0; i<=100; ++i) cerr << starting[i] << ' ';
int D;
cin >> D;
lld past=0;
for(int i=1; i<=D; ++i) {
lld Di;
cin >> Di;
cout << (starting[i]+(Di-1)+past)%DIVIDENT << endl;
past=(past+Di-1)%DIVIDENT;
past=(past*(i+1))%DIVIDENT;
// cerr << '[' << past << ']' << endl;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1672 KB |
Output is correct |
2 |
Correct |
0 ms |
1672 KB |
Output is correct |
3 |
Correct |
0 ms |
1672 KB |
Output is correct |
4 |
Correct |
0 ms |
1672 KB |
Output is correct |
5 |
Correct |
0 ms |
1672 KB |
Output is correct |
6 |
Correct |
0 ms |
1672 KB |
Output is correct |
7 |
Correct |
0 ms |
1672 KB |
Output is correct |
8 |
Correct |
0 ms |
1672 KB |
Output is correct |
9 |
Correct |
0 ms |
1672 KB |
Output is correct |
10 |
Correct |
0 ms |
1672 KB |
Output is correct |
11 |
Correct |
0 ms |
1672 KB |
Output is correct |
12 |
Correct |
0 ms |
1672 KB |
Output is correct |
13 |
Correct |
0 ms |
1672 KB |
Output is correct |
14 |
Correct |
0 ms |
1672 KB |
Output is correct |
15 |
Correct |
0 ms |
1672 KB |
Output is correct |
16 |
Correct |
0 ms |
1672 KB |
Output is correct |
17 |
Correct |
0 ms |
1672 KB |
Output is correct |
18 |
Correct |
0 ms |
1672 KB |
Output is correct |
19 |
Correct |
0 ms |
1672 KB |
Output is correct |
20 |
Correct |
0 ms |
1672 KB |
Output is correct |