Submission #2533

#TimeUsernameProblemLanguageResultExecution timeMemory
2533kipa00지우개 (GA4_eraser)C++98
13 / 100
1000 ms1276 KiB
#include <cstdio> using namespace std; const int divider = 1000000007; 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 % divider; sum %= divider; } } } printf("%d\n", sum); return 0; }
#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...