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>
using namespace std;
int N;
int a[100001];
int main() {
int i, j, k, max = -1;
int sum = 0;
long long int s;
scanf("%d", &N);
for (i=0; i<N; ++i) {
int tmp;
scanf("%d", &tmp);
++a[tmp];
if (max < tmp) {
max = tmp;
}
}
for (i=1; i<=max; ++i) {
for (j=i+1; j<=max; ++j) {
for (k=j+1; k<=max; ++k) {
s = a[i] * a[j] * a[k] * i * j * k;
sum += s % 1000000007;
}
}
}
printf("%d\n", sum);
return 0;
}
# | 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... |