Submission #2620

#TimeUsernameProblemLanguageResultExecution timeMemory
2620pull601지우개 (GA4_eraser)C++98
0 / 100
0 ms262144 KiB
#include <stdio.h> #include <stdlib.h> int d[100000001]; int kk[100000001]; int main() { long long num=0; int i,j,k,max=0,n,m; 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*k*j*d[i]*d[k]*d[j]; } } } printf("%d",num%1000000007); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...