#include <bits/stdc++.h>
#include "grader.h"
#include "lang.h"
int a[56][100000], b[100000];
int cnt[100000];
void excerpt (int* E) {
memset (cnt, 0, sizeof (cnt));
std::set <int> s;
for (int i = 0; i < 100; i++) {
cnt[E[i] % 100]++;
s.insert (E[i] % 100);
}
double mx = 0;
int x = 0;
for (int i = 0; i < 55; i++) {
double points = 0;
for (int j : s) {
if (b[j]) points += cnt[j] * (a[i][j] / b[j]);
}
if (points > mx) {
mx = points;
x = i;
}
}
x = language (x + 1) - 1;
for (int i = 0; i < 100; i++) {
b[E[i] % 100]++;
a[x][E[i] % 100]++;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
472 ms |
1120 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
458 ms |
1056 KB |
Output isn't correct - 1.98% |