#include<stdio.h>
int d[100001];
int main()
{
long long num=0;
int n,m,i,j,k,max=0;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&m); if(max<m) max=m;
d[m]+=1;
}
for(i=1;i<=max;i++){
if(d[i]==0) continue;
for(j=i+1;j<=max;j++){
if(d[j]==0) continue;
for(k=j+1;k<=max;k++){
if(d[k]==0) continue;
num=num+i*j*k*d[i]*d[j]*d[k];
}
}
}
printf("%lld",num%1000000007);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1476 KB |
Output is correct |
2 |
Correct |
0 ms |
1476 KB |
Output is correct |
3 |
Correct |
0 ms |
1476 KB |
Output is correct |
4 |
Correct |
0 ms |
1476 KB |
Output is correct |
5 |
Correct |
0 ms |
1476 KB |
Output is correct |
6 |
Correct |
0 ms |
1476 KB |
Output is correct |
7 |
Correct |
0 ms |
1476 KB |
Output is correct |
8 |
Correct |
0 ms |
1476 KB |
Output is correct |
9 |
Correct |
0 ms |
1476 KB |
Output is correct |
10 |
Correct |
0 ms |
1476 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1476 KB |
Output is correct |
2 |
Correct |
0 ms |
1476 KB |
Output is correct |
3 |
Correct |
0 ms |
1476 KB |
Output is correct |
4 |
Correct |
0 ms |
1476 KB |
Output is correct |
5 |
Correct |
0 ms |
1476 KB |
Output is correct |
6 |
Correct |
0 ms |
1476 KB |
Output is correct |
7 |
Correct |
0 ms |
1476 KB |
Output is correct |
8 |
Correct |
0 ms |
1476 KB |
Output is correct |
9 |
Correct |
0 ms |
1476 KB |
Output is correct |
10 |
Correct |
0 ms |
1476 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
72 ms |
1476 KB |
Output is correct |
2 |
Correct |
36 ms |
1476 KB |
Output is correct |
3 |
Correct |
184 ms |
1476 KB |
Output is correct |
4 |
Correct |
148 ms |
1476 KB |
Output is correct |
5 |
Correct |
176 ms |
1476 KB |
Output is correct |
6 |
Correct |
140 ms |
1476 KB |
Output is correct |
7 |
Correct |
152 ms |
1476 KB |
Output is correct |
8 |
Correct |
0 ms |
1476 KB |
Output is correct |
9 |
Correct |
0 ms |
1476 KB |
Output is correct |
10 |
Correct |
172 ms |
1476 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
44 ms |
1476 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1000 ms |
1472 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1000 ms |
1472 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |