1263C - Everyone is a Winner - CodeForces Solution

#include <bits/stdc++.h>
#define ALL(s) (s).begin(), (s).end()
#define rALL(s) (s).rbegin(), (s).rend()
#define sz(s) (int)(s).size()
#define mkp make_pair
#define pb push_back
#define sqr(s) ((s) * (s))

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int ui;

#ifdef EUGENE
	mt19937 rng(1337);
#else
	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#endif

void solve() {
	int n;
	cin >> n;
	vector<int> ans;
	int s = (int)sqrtl(n);
	for (int i = 0; i <= s; i++)
		ans.pb(i);
	for (int i = 1; i <= s; i++)
		ans.pb(n / i);
	sort(ALL(ans));
	ans.resize(unique(ALL(ans)) - ans.begin());
	cout << sz(ans) << endl;
	for (int &x : ans)
		cout << x << " ";
	cout << endl;
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0);
	#ifdef EUGENE
		freopen("input.txt", "r", stdin);
		// freopen("output.txt", "r", stdout);
	#endif

	int t;
	cin >> t;
	while (t--)
		solve();
}