# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7898 | gs14004 | 지우개 (GA4_eraser) | C++98 | 24 ms | 2648 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |