| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 2584 | pull601 | 지우개 (GA4_eraser) | C11 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include<stdio.h>
using namespace std;
int d[100000001];
int kk[100000001];
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",&kk[i]);
if(max<kk[i]) max=kk[i];
d[kk[i]]=d[kk[i]]+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*k*j*d[i]*d[k]*d[j];
}
}
}
printf("%d",num%1000000007);
return 0;
}