#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sz(x) (int)x.size()
#define all(x) x.begin() , x.end()
const int N = 40;
inline int gcd(int a , int b){
if(a == 0)return b;
return gcd(b % a , a);
}
inline int hsb(long long &x){
return 63 - __builtin_clzll(x);
}
inline void nxt(long long &state){
int x = __builtin_ctzll(~state);
state >>= x;
state ^= 1;
state <<= x;
for(int i = hsb(state);i>0;i--)
if((1ll << i) & state)
for(int j = i-1;j>0;j--)
if((1ll << j) & state)
state |= 1ll << (gcd(i+1,j+1)-1);
}
void solve(){
long long state = 0;
int x;
cin >> x;
for(int i = 0;i<x;i++){
nxt(state);
}
cout << __builtin_popcountll(state) << " ";
for(int i = 0;i<N;i++){
if((1ll << i) & state){
cout << i+1 << " ";
}
}
cout << endl;
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int testcase=1;cin >> testcase;
while(testcase--)solve();
cerr << 1000.0 * clock() / CLOCKS_PER_SEC << " ms" << endl;
}
| # | 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... |