#include<stdio.h>
int mod=1000000007;
int ar[100001];
int aa[100001];
int sum1[100001];
int sum2[100001];
int main()
{
long long s=0;
int n,i,size=0;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&ar[i]);
aa[ar[i]]++;
}
for(i=1;i<=100000;i++){
if(aa[i])
ar[++size]=i;
}
for(i=1;i<=size;i++){
sum1[i]=sum1[i-1]+ar[i];
sum2[i]=sum2[i-1]+ar[i]*ar[i];
}
for(i=1;i<=size-2;i++){
s+=aa[ar[i]]*ar[i]*((sum1[size]-sum1[i])*(sum1[size]-sum1[i])-(sum2[size]-sum2[i]))/2;
s=s%mod;
}
printf("%lld",s);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2448 KB |
Output is correct |
2 |
Correct |
0 ms |
2448 KB |
Output is correct |
3 |
Correct |
0 ms |
2448 KB |
Output is correct |
4 |
Correct |
0 ms |
2448 KB |
Output is correct |
5 |
Correct |
0 ms |
2448 KB |
Output is correct |
6 |
Correct |
0 ms |
2448 KB |
Output is correct |
7 |
Correct |
0 ms |
2448 KB |
Output is correct |
8 |
Correct |
0 ms |
2448 KB |
Output is correct |
9 |
Correct |
0 ms |
2448 KB |
Output is correct |
10 |
Correct |
0 ms |
2448 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
2448 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
2448 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
2448 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
12 ms |
2448 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
14 ms |
2448 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |