题意:给一个数n,要求n以内(包括0和n)每个数除n的向下取整值得集合,比如
0=⌊5/7⌋0=⌊5/7⌋, 1=⌊5/5⌋1=⌊5/5⌋, 2=⌊5/2⌋2=⌊5/2⌋, 5=⌊5/1⌋5=⌊5/1⌋.
则输出0 1 2 5
思路:令m = n开方,然后把0到m以内的数全部存进ans,再把1到m的数逐个被n除以,存入ans,排序去重即是答案
证明:待更新
代码:
#include <iostream>
#include <set>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
ll T;
cin >> T;
while(T--) {
int n;
cin >> n;
int m = (int)sqrtl(n);
vector<int> ans;
for (int i = 0; i <= m; i++) {
ans.push_back(i);
}
for (int i = 1; i <= m; ++i)
{
ans.push_back(n/i);
}
sort(ans.begin(), ans.end());
ans.resize(unique(ans.begin(), ans.end()) - ans.begin());
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
i == 0? cout << ans[i] : cout << " " << ans[i];
}
cout << endl;
}
}