Submission #7898

#TimeUsernameProblemLanguageResultExecution timeMemory
7898gs14004지우개 (GA4_eraser)C++98
46 / 100
24 ms2648 KiB
#include <cstdio>

int n;
long long a[100005];
long long sum[100005];
long long mod = 1e9+7;
int main(){
    int t;
    scanf("%d",&n);
    for (int i=0; i<n; i++) {
        scanf("%d",&t);
        a[t]++;
    }
    for (int i=1; i<=100000; i++) {
        a[i] *= i;
        a[i] %= mod;
    }
    for (int i=1; i<=100000; i++) {
        sum[i] = a[i] + sum[i-1];
    }
    long long res = 0;
    for (int i=1; i<=1000; i++) {
        for (int j=i+1; j<=1000; j++) {
            res += a[i] * a[j] * (sum[100000] - sum[j]);
            res %= mod;
        }
    }
    printf("%lld",res);
    // iCnti
    
}
#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...