# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
643338 | Matteo_Verz | Present (RMI21_present) | C++17 | 1477 ms | 8844 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(long long &mask) {
for (int i = 1; i <= 40; i++) {
mask ^= (1LL << i);
if (mask & (1LL << i))
break;
}
long long gcd = 0;
for (int i = 1; i <= 40; i++)
for (int j = i + 1; j <= 40; j++)
if ((mask & (1LL << i)) && (mask & (1LL << j)))
gcd |= (1LL << (__gcd(i, j)));
for (int i = 40; i >= 1; i--)
if (gcd & (1LL << i))
mask |= (1LL << i);
}
void printSet(long long set, int setidx) {
// cout << "S" << setidx << " = ";
cout << __builtin_popcountll(set) << ' ';
# | 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... |