#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <deque>
#include <utility>
#include <bitset>
#include <limits.h>
#include <time.h>
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef double lf;
typedef unsigned int uint;
typedef long double llf;
typedef pair<int, int> pii;
int N;
ll res1, res2 = 1;
int main() {
scanf("%d", &N);
ll sum = 0;
for(int i = 1; i <= N; i++) {
int si; scanf("%d", &si);
res1 += sum * si;
sum += si;
}
for(int i = 2; i <= N; i++) {
res2 *= i;
res2 %= (ll)1e9 + 7;
res2 *= i-1;
res2 %= (ll)1e9 + 7;
}
printf("%lld\n%lld\n\n", res1, res2);
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
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 |
| 21 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 25 |
Correct |
4 ms |
1088 KB |
Output is correct |
| 26 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 27 |
Correct |
4 ms |
1088 KB |
Output is correct |
| 28 |
Correct |
4 ms |
1088 KB |
Output is correct |
| 29 |
Correct |
4 ms |
1088 KB |
Output is correct |
| 30 |
Correct |
0 ms |
1088 KB |
Output is correct |
| 31 |
Correct |
4 ms |
1088 KB |
Output is correct |
| 32 |
Correct |
4 ms |
1088 KB |
Output is correct |
| 33 |
Correct |
4 ms |
1088 KB |
Output is correct |
| 34 |
Correct |
4 ms |
1088 KB |
Output is correct |
| 35 |
Correct |
4 ms |
1088 KB |
Output is correct |
| 36 |
Correct |
4 ms |
1088 KB |
Output is correct |
| 37 |
Correct |
8 ms |
1088 KB |
Output is correct |
| 38 |
Correct |
8 ms |
1088 KB |
Output is correct |
| 39 |
Correct |
4 ms |
1088 KB |
Output is correct |
| 40 |
Correct |
4 ms |
1088 KB |
Output is correct |
| 41 |
Correct |
8 ms |
1088 KB |
Output is correct |
| 42 |
Correct |
8 ms |
1088 KB |
Output is correct |
| 43 |
Correct |
4 ms |
1088 KB |
Output is correct |
| 44 |
Correct |
8 ms |
1088 KB |
Output is correct |
| 45 |
Correct |
8 ms |
1088 KB |
Output is correct |
| 46 |
Correct |
8 ms |
1088 KB |
Output is correct |
| 47 |
Correct |
12 ms |
1088 KB |
Output is correct |
| 48 |
Correct |
12 ms |
1088 KB |
Output is correct |
| 49 |
Correct |
12 ms |
1088 KB |
Output is correct |
| 50 |
Correct |
12 ms |
1088 KB |
Output is correct |
