oj.uz

답안 #3672

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
3672 2013-08-31T07:33:23 Z solveit Inherited disease (kriii1_I) C++
1 / 1
 0 ms 1676 KB 
#include <iostream>
#include <string>
#include <math.h>
#include <sstream>
#include <cstdio>
#include <algorithm>
#include <set>
#include <vector>
#include <stdio.h>

using namespace std;

#define MOD 1000000007
#define ll long long

int D, A[105];
ll currCnt[105], totalCnt[105];
ll currNum[105];

int main() {
    scanf("%d",&D);
    for(int i = 1;i<=D;i++)
        scanf("%d",&A[i]);

    currNum[0] = 1;
    currCnt[0] = 1;
    for(int i = 1;i<=D;i++) {
        currCnt[i] = currCnt[i - 1] * i;
        currCnt[i] %= MOD;

        totalCnt[i] = totalCnt[i - 1] + currCnt[i];
        totalCnt[i] %= MOD;

        currNum[i] = (currNum[i - 1] - 1) * i + A[i];
        currNum[i] %= MOD;

        printf("%d\n", (totalCnt[i - 1] + currNum[i])%MOD);
    }
    return 0;
}

Subtask #1
1.0 / 1.0

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