# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
643342 | Matteo_Verz | Present (RMI21_present) | C++17 | 797 ms | 86236 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>
#ifdef BLAT
#include "debug/debug.hpp"
#else
#define debug(x...)
#endif
using namespace std;
void generateNextSet(vector <int> &set) {
int lastdeleted = 0;
while (true) {
if (set.empty() || set.back() > lastdeleted + 1) {
set.push_back(lastdeleted + 1);
break;
}
lastdeleted = set.back();
set.pop_back();
}
long long gcd = 0;
for (int i = 0; i < set.size(); i++)
for (int j = i + 1; j < set.size(); j++)
gcd |= (1 << (__gcd(set[i], set[j])));
for (int i = set.back() - 1; i >= 1; i--)
if (gcd & (1 << i))
set.push_back(i);
}
Compilation message (stderr)
# | 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... |