#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>
#include <stdlib.h>
using namespace std;
const int mmod = 1000000007;
int main()
{
int N;
cin >> N;
vector<int> S(N);
for (int i=0; i<N; i++) cin >> S[i];
long long res1 = 0, res2 = 1;
long long ss = 0;
for (int i=0; i<N; i++) {
res1 += S[i] * ss;
if (i) res2 = (res2 * i) % mmod;
res2 = (res2 * (long long)(i+1)) % mmod;
ss += S[i];
}
cout << res1 << endl;
cout << res2 << endl;
}
| # |
결과 |
실행 시간 |
메모리 |
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 |
4 ms |
1672 KB |
Output is correct |
| 18 |
Correct |
4 ms |
1672 KB |
Output is correct |
| 19 |
Correct |
4 ms |
1672 KB |
Output is correct |
| 20 |
Correct |
4 ms |
1672 KB |
Output is correct |
| 21 |
Correct |
4 ms |
1672 KB |
Output is correct |
| 22 |
Correct |
4 ms |
1672 KB |
Output is correct |
| 23 |
Correct |
4 ms |
1672 KB |
Output is correct |
| 24 |
Correct |
4 ms |
1672 KB |
Output is correct |
| 25 |
Correct |
8 ms |
1672 KB |
Output is correct |
| 26 |
Correct |
8 ms |
1672 KB |
Output is correct |
| 27 |
Correct |
8 ms |
1672 KB |
Output is correct |
| 28 |
Correct |
8 ms |
1672 KB |
Output is correct |
| 29 |
Correct |
8 ms |
1804 KB |
Output is correct |
| 30 |
Correct |
4 ms |
1816 KB |
Output is correct |
| 31 |
Correct |
8 ms |
1824 KB |
Output is correct |
| 32 |
Correct |
12 ms |
1836 KB |
Output is correct |
| 33 |
Correct |
12 ms |
1844 KB |
Output is correct |
| 34 |
Correct |
12 ms |
1856 KB |
Output is correct |
| 35 |
Correct |
12 ms |
1864 KB |
Output is correct |
| 36 |
Correct |
16 ms |
1876 KB |
Output is correct |
| 37 |
Correct |
16 ms |
1888 KB |
Output is correct |
| 38 |
Correct |
16 ms |
1900 KB |
Output is correct |
| 39 |
Correct |
16 ms |
1912 KB |
Output is correct |
| 40 |
Correct |
12 ms |
1924 KB |
Output is correct |
| 41 |
Correct |
20 ms |
1936 KB |
Output is correct |
| 42 |
Correct |
16 ms |
1948 KB |
Output is correct |
| 43 |
Correct |
12 ms |
1964 KB |
Output is correct |
| 44 |
Correct |
20 ms |
1976 KB |
Output is correct |
| 45 |
Correct |
24 ms |
1992 KB |
Output is correct |
| 46 |
Correct |
24 ms |
2004 KB |
Output is correct |
| 47 |
Correct |
24 ms |
2020 KB |
Output is correct |
| 48 |
Correct |
28 ms |
2036 KB |
Output is correct |
| 49 |
Correct |
28 ms |
2048 KB |
Output is correct |
| 50 |
Correct |
28 ms |
2064 KB |
Output is correct |
