1
class Solution {
2
 public:
3
  int kthFactor(int n, int k) {
4
    vector<int> sol;
5
    sol.push_back(1);
6
    for (int i = 2; i <= n / 2; i++) {
7
      if (n % i == 0) sol.push_back(i);
8
    }
9
    if (n != 1) sol.push_back(n);
10
    if (k > sol.size()) return -1;
11
    return sol[k - 1];
12
  }
13
};