#include <stdio.h>
int main()
{
int N;
int s[100001];
long long cnt;
long long sum;
int i,j;
cnt = 1;
sum = 0;
scanf("%d",&N);
for(i=0;i<N;i++)scanf("%d",s+i);
for(i=0;i<N-1;i++)
{
sum += s[i]*s[i+1];
s[i+1] += s[i];
cnt = (cnt*(N-i)*(N-i-1))%1000000007;
}
printf("%lld\n",sum);
printf("%lld\n",N==1?0:cnt);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1356 KB |
Output is correct |
2 |
Correct |
0 ms |
1356 KB |
Output is correct |
3 |
Correct |
0 ms |
1352 KB |
Output is correct |
4 |
Correct |
0 ms |
1352 KB |
Output is correct |
5 |
Correct |
0 ms |
1356 KB |
Output is correct |
6 |
Correct |
0 ms |
1352 KB |
Output is correct |
7 |
Correct |
0 ms |
1360 KB |
Output is correct |
8 |
Correct |
0 ms |
1352 KB |
Output is correct |
9 |
Correct |
0 ms |
1352 KB |
Output is correct |
10 |
Correct |
0 ms |
1352 KB |
Output is correct |
11 |
Correct |
0 ms |
1360 KB |
Output is correct |
12 |
Correct |
0 ms |
1352 KB |
Output is correct |
13 |
Correct |
0 ms |
1352 KB |
Output is correct |
14 |
Correct |
0 ms |
1356 KB |
Output is correct |
15 |
Correct |
0 ms |
1356 KB |
Output is correct |
16 |
Correct |
0 ms |
1356 KB |
Output is correct |
17 |
Correct |
0 ms |
1356 KB |
Output is correct |
18 |
Correct |
0 ms |
1356 KB |
Output is correct |
19 |
Correct |
0 ms |
1356 KB |
Output is correct |
20 |
Correct |
0 ms |
1352 KB |
Output is correct |
21 |
Correct |
0 ms |
1352 KB |
Output is correct |
22 |
Correct |
0 ms |
1356 KB |
Output is correct |
23 |
Correct |
0 ms |
1356 KB |
Output is correct |
24 |
Correct |
0 ms |
1352 KB |
Output is correct |
25 |
Correct |
4 ms |
1356 KB |
Output is correct |
26 |
Correct |
4 ms |
1352 KB |
Output is correct |
27 |
Correct |
4 ms |
1356 KB |
Output is correct |
28 |
Correct |
4 ms |
1352 KB |
Output is correct |
29 |
Correct |
4 ms |
1360 KB |
Output is correct |
30 |
Correct |
4 ms |
1352 KB |
Output is correct |
31 |
Correct |
4 ms |
1356 KB |
Output is correct |
32 |
Correct |
4 ms |
1360 KB |
Output is correct |
33 |
Correct |
0 ms |
1352 KB |
Output is correct |
34 |
Correct |
0 ms |
1356 KB |
Output is correct |
35 |
Correct |
0 ms |
1360 KB |
Output is correct |
36 |
Correct |
4 ms |
1360 KB |
Output is correct |
37 |
Correct |
4 ms |
1360 KB |
Output is correct |
38 |
Correct |
8 ms |
1352 KB |
Output is correct |
39 |
Correct |
8 ms |
1356 KB |
Output is correct |
40 |
Correct |
8 ms |
1352 KB |
Output is correct |
41 |
Correct |
8 ms |
1356 KB |
Output is correct |
42 |
Correct |
8 ms |
1356 KB |
Output is correct |
43 |
Correct |
4 ms |
1356 KB |
Output is correct |
44 |
Correct |
8 ms |
1352 KB |
Output is correct |
45 |
Correct |
8 ms |
1356 KB |
Output is correct |
46 |
Correct |
12 ms |
1356 KB |
Output is correct |
47 |
Correct |
12 ms |
1352 KB |
Output is correct |
48 |
Correct |
8 ms |
1360 KB |
Output is correct |
49 |
Correct |
12 ms |
1356 KB |
Output is correct |
50 |
Partially correct |
12 ms |
1352 KB |
Output is partially correct |