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