oj.uz

Submission #3096

# Submission time Handle Problem Language Result Execution time Memory
3096 2013-08-24T15:46:03 Z tncks0121 Inherited disease (kriii1_I) C++
1 / 1
 0 ms 1088 KB 
#include <stdio.h>

typedef long long ll;
const ll MOD = 1000000007;

int D;
ll sum, fac, nd;

int main() {
    int i, j, k;
    
    scanf("%d", &D);
    fac = 1;
    
    for(i = 1; i <= D; i++) {
        scanf("%d", &k); --k;
        // x 레벨에  x! 개의 노드가 있음
        
        sum += fac; sum %= MOD;
        fac *= i; fac %= MOD;
        nd -= sum; nd += MOD; nd %= MOD;
        nd *= i; nd %= MOD;
        nd += k + sum + fac; nd %= MOD;
        
        printf("%lld\n", nd);
    }
    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory 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