# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
512968 | Markomafko972 | Languages (IOI10_languages) | C++17 | 9269 ms | 34720 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 <bits/stdc++.h>
#include <stdlib.h>
#include <stdio.h>
#include "grader.h"
#include "lang.h"
using namespace std;
typedef unsigned long long ll;
unordered_map<int, ll> m[60];
set<ll> s;
vector<ll> v;
void excerpt(int *E) {
s.clear();
v.clear();
for (int i = 0; i < 100; i++) {
E[i]--;
s.insert(E[i]);
if (i > 0) s.insert((ll)65535*(ll)E[i-1]+(ll)E[i]);
if (i > 1) {
ll u = E[i-2];
u = u * (ll)65535 + (ll)E[i-1];
u = u * (ll)65535 + (ll)E[i];
s.insert(u);
}
if (i > 2 && (i <= 40 || i >= 90 || i % 2 == 0 || i % 3 == 0 || i % 5 == 0 || i % 7 == 0 || i % 11 == 0)) {
ll u = E[i-3];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |