#include<cstdio>
#include<cassert>
#include<cstring>
#include<map>
#include<set>
#include<time.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<utility>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
using namespace std;
const long long MOD = 1000000007;
long long go(long long n) {
long long ret = 1;
for(long long i = 2; i <= n; ++i) { ret = (ret * i) % MOD; }
for(long long i = 2; i <= n-1; ++i) { ret = (ret * i) % MOD; }
return ret;
}
int main() {
long long n;
cin >> n;
long long ret = 0;
long long cursize = 0;
for(int i = 0; i < n; ++i) {
long long s;
cin >> s;
ret += cursize * s;
cursize += s;
}
cout << ret << endl;
cout << go(n) << 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 |
4 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 |
1672 KB |
Output is correct |
| 30 |
Correct |
8 ms |
1672 KB |
Output is correct |
| 31 |
Correct |
8 ms |
1672 KB |
Output is correct |
| 32 |
Correct |
8 ms |
1672 KB |
Output is correct |
| 33 |
Correct |
8 ms |
1672 KB |
Output is correct |
| 34 |
Correct |
12 ms |
1672 KB |
Output is correct |
| 35 |
Correct |
12 ms |
1672 KB |
Output is correct |
| 36 |
Correct |
16 ms |
1672 KB |
Output is correct |
| 37 |
Correct |
12 ms |
1672 KB |
Output is correct |
| 38 |
Correct |
16 ms |
1672 KB |
Output is correct |
| 39 |
Correct |
16 ms |
1672 KB |
Output is correct |
| 40 |
Correct |
16 ms |
1672 KB |
Output is correct |
| 41 |
Correct |
20 ms |
1672 KB |
Output is correct |
| 42 |
Correct |
20 ms |
1672 KB |
Output is correct |
| 43 |
Correct |
20 ms |
1672 KB |
Output is correct |
| 44 |
Correct |
20 ms |
1672 KB |
Output is correct |
| 45 |
Correct |
24 ms |
1672 KB |
Output is correct |
| 46 |
Correct |
24 ms |
1672 KB |
Output is correct |
| 47 |
Correct |
24 ms |
1672 KB |
Output is correct |
| 48 |
Correct |
24 ms |
1672 KB |
Output is correct |
| 49 |
Correct |
28 ms |
1672 KB |
Output is correct |
| 50 |
Correct |
28 ms |
1672 KB |
Output is correct |
