# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
643737 | Matteo_Verz | Present (RMI21_present) | C++17 | 1974 ms | 340 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;
const int K = 1500000000;
vector <vector <short>> generateGCD() {
vector <vector <short>> gcd(40, vector <short>(40));
for (int i = 0; i < 40; i++)
for (int j = 0; j < 40; j++)
gcd[i][j] = gcd[j][i] = __gcd(i, j);
return gcd;
}
void generateNextSet(vector <int> &set, vector <vector <short>> &gcd) {
int lastdeleted = 0;
while (true) {
if (set.empty() || set.back() > lastdeleted + 1) {
set.push_back(lastdeleted + 1);
break;
}
lastdeleted = set.back();
set.pop_back();
}
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... |