Submission #17444

#TimeUsernameProblemLanguageResultExecution timeMemory
17444atomzeno지우개 (GA4_eraser)C++98
48 / 100
15 ms1864 KiB
#include<stdio.h>
#define MOD 1000000007
#define MX 100021
long long int A[MX],c1,c2,c3,six=166666668,ans;
int main(){
    int n,i;
    scanf("%lld",&n);
    for(i=0;i<n;i++){
        scanf("%lld",&A[i]);
        c1=c1+A[i];
        c2=c2+(A[i]*A[i]%MOD);
        c3=c3+((A[i]*A[i]%MOD)*A[i]%MOD);
        c1%=MOD;
        c2%=MOD;
        c3%=MOD;
    }
    ans=((c1*c1%MOD)*c1%MOD)+c3+c3-(c1*c2%MOD)-(c1*c2%MOD)-(c1*c2%MOD);
    ans=(MOD+ans)%MOD;
    ans=(MOD+ans)%MOD;
    ans*=six;
    ans%=MOD;
    printf("%lld",ans);
}
#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...