Submission #2156

#TimeUsernameProblemLanguageResultExecution timeMemory
2156jwvg0425지우개 (GA4_eraser)C++98
0 / 100
10 ms2448 KiB
#include<stdio.h> #include<stdlib.h> #define MOD 1000000007 int n; long long int a[100000]; long long int v,s[100000]; int compare(const void* a,const void* b) { return *((int*)a)>*((int*)b)?1:0; } int main() { int i,j,k; scanf("%d",&n); for(i=0;i<n;i++)scanf("%lld",&a[i]); qsort(a,n,sizeof(long long int),compare); s[0]=a[0]; for(i=1;i<n;i++)s[i]=s[i-1]+a[i]; for(i=0;i<n-2;i++) { for(j=i+1;j<n-1;j++) { for(k=j+1;k<n;k++) { v+=a[i]*a[j]*a[k]; } } } printf("%lld",v); }
#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...