Submission #2581

#TimeUsernameProblemLanguageResultExecution timeMemory
2581pull601지우개 (GA4_eraser)C++98
0 / 100
0 ms262144 KiB
#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; }
#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...