#pragma GCC optimize("O3")
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#define endl '\n'
#include <unordered_map>
using namespace std;
typedef long long ll;
ll used[10001];
ll step = 0;
bool check(vector<ll>a){
step++;
for(auto i: a){
used[i] = step;
for(auto j: a){
if(used[__gcd(i, j)] != step)
return false;
}
}
return true;
}
int main(){
vector<vector<ll>>d(5000009);
int pos = 1;
for(int num = 1; num <= 1000000; num++){
d[pos++] = {num};
ll last = pos - 1;
for(int j = 1; j < last; j++){
d[pos] = d[j];
d[pos].push_back(num);
if(!check(d[pos]))
continue;
pos++;
if(pos >= 50000001)
break;
}
if(pos >= 50000001)
break;
}
ll t;
cin >> t;
while(t--){
ll n;
cin >> n;
cout << d[n].size() << ' ';
for(auto i: d[n])
cout << i << ' ';
cout << endl;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
4086 ms |
354156 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
4086 ms |
354156 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
4086 ms |
354156 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
4086 ms |
354156 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
4086 ms |
354156 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |