#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <set>
using namespace std;
int mmod = 1000000007;
int main()
{
int D;
cin >> D;
int prv_start = 0;
int prv_num = 0;
int fac = 1;
for (int i=1; i<=D; i++) {
int tmp;
cin >> tmp;
int nxt_start = (prv_start + fac) % mmod;
int nxt_num = (tmp - 1 + nxt_start + 1LL * (prv_num - prv_start) * i) % mmod;
fac = (1LL * fac * i) % mmod;
printf("%d\n", nxt_num);
prv_start = nxt_start;
prv_num = nxt_num;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1676 KB |
Output is correct |
2 |
Incorrect |
0 ms |
1676 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |