Submission #20125

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
20125	2016-02-26T15:31:56 Z	gs14004	Inherited disease (kriii1_I)	C++14	1 / 1	1 ms	1720 KB

I

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <deque>
#include <utility>
#include <bitset>
#include <iostream>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
const int mod = 1e9 + 7;

lint fact[105];
int n, a[105];

int main(){
	cin >> n;
	fact[0] = 1;
	for(int i=1; i<=n; i++){
		fact[i] = fact[i-1] * i % mod;
	}
	lint ret = 0, ps = 0;
	for(int i=1; i<=n; i++){
		int t;
		cin >> t;
		ret = ret * i + t - 1;
		ret %= mod;
		ps += fact[i-1];
		cout << (ret + ps) % mod << endl;
	}
}

Subtask #1

1.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	1720 KB	Output is correct
2	Correct	0 ms	1720 KB	Output is correct
3	Correct	0 ms	1720 KB	Output is correct
4	Correct	0 ms	1720 KB	Output is correct
5	Correct	0 ms	1720 KB	Output is correct
6	Correct	0 ms	1720 KB	Output is correct
7	Correct	0 ms	1720 KB	Output is correct
8	Correct	0 ms	1720 KB	Output is correct
9	Correct	1 ms	1720 KB	Output is correct
10	Correct	0 ms	1720 KB	Output is correct
11	Correct	0 ms	1720 KB	Output is correct
12	Correct	0 ms	1720 KB	Output is correct
13	Correct	0 ms	1720 KB	Output is correct
14	Correct	0 ms	1720 KB	Output is correct
15	Correct	0 ms	1720 KB	Output is correct
16	Correct	0 ms	1720 KB	Output is correct
17	Correct	0 ms	1720 KB	Output is correct
18	Correct	0 ms	1720 KB	Output is correct
19	Correct	0 ms	1720 KB	Output is correct
20	Correct	0 ms	1720 KB	Output is correct