classSolution{public:voidcheck(int n,int&a,int&b){for(int i =1; i <= n / i; i ++)//i [1, n] 遍历复杂度太高了!{if(n % i ==0){if(abs(i -(n / i))<abs(a - b)){
a = i;
b = n / i;}}}}
vector<int>closestDivisors(int num){int a =0, b =1e9;check(num +1, a, b);check(num +2, a, b);return{a, b};}};
1. n 的第 k 个因子class Solution {public: int kthFactor(int n, int k) { vector<int> ans; for (int i = 1; i <= n / i; i ++ ) { if (n % i == 0) { if (i == n / i) ans.push_back(i);