제출 #871612

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
871612		TAhmed33	Present (RMI21_present)	C++98	0 / 100	2720 ms	524288 KiB

Main

#include <bits/stdc++.h>
using namespace std;
vector <vector <int>> dd;
const int n = 35;
vector <int> cur;
int freq[n + 1];
void gen (int pos) {
	if (pos == n + 1) {
		dd.push_back(cur);
		reverse(dd.back().begin(), dd.back().end());
		return;
	}
	gen(pos + 1);
	bool flag = 0;
	for (auto i : cur) {
		flag |= !freq[__gcd(pos, i)];
	}
	if (flag) return;
	cur.push_back(pos); freq[pos] = 1; gen(pos + 1);
	cur.pop_back(); freq[pos] = 0;
}
int main () {
	gen(1);
	sort(dd.begin(), dd.end());
	int t;
	cin >> t;
	while (t--) {
		int k;
		cin >> k;
		cout << dd[k].size() << " ";
		for (int i = dd[k].size() - 1; i >= 0; i--) {
			cout << dd[k][i] << " ";
		}
		cout << '\n';
	}
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 21
• Subtask 3: 0 / 41
• Subtask 4: 0 / 14
• Subtask 5: 0 / 16