#include <stdio.h>
int main() {
int N;
scanf( "%d", &N );
long long res = 0;
long long s = 0;
for( int i = 1; i <= N; i ++ ) {
long long a;
scanf( "%lld", &a );
res += s * a;
s += a;
}
printf( "%lld\n", res );
s = 1;
for( int i = 1; i < N; i ++ ) {
s *= i;
s %= 1000000007;
}
for( int i = 1; i <= N; i ++ ) {
s *= i;
s %= 1000000007;
}
printf( "%lld\n", s );
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 |
0 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 |
4 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 |
4 ms |
1088 KB |
Output is correct |
38 |
Correct |
8 ms |
1088 KB |
Output is correct |
39 |
Correct |
8 ms |
1088 KB |
Output is correct |
40 |
Correct |
8 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 |
8 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 |