#800615 (C++17) No.2081 Make a Test Case of GCD Subset

• 問題: No.2081 Make a Test Case of GCD Subset
• ユーザー: kaikey
• 提出日時: 2022-09-25 22:06:07
• 言語: C++17 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 9 ms / 2,000 ms
• コード長: 4,984 bytes
• コンパイル時間: 2,780 ms
• コンパイル使用メモリ: 226,708 KB
• 実行使用メモリ: 4,380 KB
• 最終ジャッジ日時: 2023-08-24 02:14:45
• 合計ジャッジ時間: 7,051 ms
• ジャッジサーバーID （参考情報）: judge15 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,376 KB
testcase_01	AC	4 ms; 4,376 KB
testcase_02	AC	5 ms; 4,380 KB
testcase_03	AC	3 ms; 4,376 KB
testcase_04	AC	2 ms; 4,376 KB
testcase_05	AC	3 ms; 4,380 KB
testcase_06	AC	4 ms; 4,380 KB
testcase_07	AC	3 ms; 4,376 KB
testcase_08	AC	6 ms; 4,376 KB
testcase_09	AC	3 ms; 4,376 KB
testcase_10	AC	4 ms; 4,376 KB
testcase_11	AC	4 ms; 4,376 KB
testcase_12	AC	4 ms; 4,380 KB
testcase_13	AC	4 ms; 4,380 KB
testcase_14	AC	9 ms; 4,376 KB
testcase_15	AC	3 ms; 4,380 KB
testcase_16	AC	5 ms; 4,380 KB
testcase_17	AC	4 ms; 4,376 KB
testcase_18	AC	2 ms; 4,380 KB
testcase_19	AC	5 ms; 4,376 KB
testcase_20	AC	2 ms; 4,380 KB
testcase_21	AC	1 ms; 4,376 KB
testcase_22	AC	3 ms; 4,380 KB
testcase_23	AC	1 ms; 4,380 KB
testcase_24	AC	2 ms; 4,376 KB
testcase_25	AC	2 ms; 4,376 KB
testcase_26	AC	2 ms; 4,376 KB
testcase_27	AC	2 ms; 4,380 KB

ソースコード

#include "bits/stdc++.h"
#include <random>
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(10); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto mul = [](T a, T b) -> T { return a * b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>; using VVVl = V<V<Vl>>;
template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {
	for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");
	return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
	for (T& in : v) is >> in;
	return is;
}
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template <class T>
T div_floor(T a, T b) {
	if (b < 0) a *= -1, b *= -1;
	return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
	if (b < 0) a *= -1, b *= -1;
	return a > 0 ? (a - 1) / b + 1 : a / b;
}
template <class F> struct rec {
	F f;
	rec(F&& f_) : f(std::forward<F>(f_)) {}
	template <class... Args> auto operator()(Args &&... args) const {
		return f(*this, std::forward<Args>(args)...);
	}
};
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }
lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }
bool check_overflow(lint a, lint b, lint limit) { if (b == 0) return false; return a >= limit / b; } // a * b > c => true
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 1e18;
lint dx[8] = { 0, 1, 0, -1, 1, -1, 1, -1 }, dy[8] = { 1, 0, -1, 0, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
	lint from, to;
	lint cost;
	Edge() {

	}
	Edge(lint u, lint v, lint c) {
		cost = c;
		from = u;
		to = v;
	}
	bool operator<(const Edge& e) const {
		return cost < e.cost;
	}
};
struct WeightedEdge {
	lint to;
	lint cost;
	WeightedEdge(lint v, lint c) {
		to = v;
		cost = c;
	}
	bool operator<(const WeightedEdge& e) const {
		return cost < e.cost;
	}
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<lint, plint> tlint;
typedef pair<ld, ld> pld;
typedef pair<plint, plint> qlint;
typedef pair<char, lint> vstr;
typedef pair<lint, Vl> valv;

vector< int64_t > divisor(int64_t n) {
	vector< int64_t > ret;
	for (int64_t i = 1; i * i <= n; i++) {
		if (n % i == 0) {
			ret.push_back(i);
			if (i * i != n) ret.push_back(n / i);
		}
	}
	sort(begin(ret), end(ret));
	return (ret);
}

map< int64_t, int > prime_factor(int64_t n) {
	map< int64_t, int > ret;
	for (int64_t i = 2; i * i <= n; i++) {
		while (n % i == 0) {
			ret[i]++;
			n /= i;
		}
	}
	if (n != 1) ret[n] = 1;
	return ret;
}

int main() {
	lint M;
	cin >> M;
	if (M == 0) {
		cout << 1 << endk;
		cout << 1 << endk;
		return 0;
	}
	Vl vs;
	IREP(i, 34) {
		if (M >= ((1ll << (i + 1)) - 1)) {
			M -= ((1ll << (i + 1)) - 1);
			vs.push_back(i + 1);
		}
		if (M >= ((1ll << (i + 1)) - 1)) {
			M -= ((1ll << (i + 1)) - 1);
			vs.push_back(i + 1);
		}
	}
	assert(M == 0);
	set<lint> primes;
	V<plint> needs;
	lint idx = 0;
	REP(i, 1000) {
		if (idx == SZ(vs)) break;
		lint k = i + 2;
		if (SZ(divisor(k)) == 2) {
			primes.insert(k);
			needs.push_back({ k, vs[idx] });
			idx++;
		}
	}
	Vl ans;
	IREP(i, idx) {
		lint curr = 1, v = needs[i].first, cnt = 0;
		set<lint> tmp;
		primes.erase(v);
		while (cnt < needs[i].second) {
			auto mp = prime_factor(curr * v);
			bool flag = true;
			for (auto p : mp) {
				if (primes.count(p.first)) flag = false;
			}
			if (flag) {
				ans.push_back(curr * v);
				cnt++;
				for (auto p : mp) {
					tmp.insert(p.first);
				}
			}
			curr++;
		}
		primes.insert(v);
		for (lint v : tmp) primes.insert(v);
	}
	sort(ALL(ans));
	cout << SZ(ans) << endk;
	cout << ans << endk;
}