leetcode

0 class Solution {

1 public:

2 int kthFactor(int n, int k) {

3 int d = 1;

4 for (; d * d <= n; d++) {

5 if (n % d == 0 && --k == 0) return d;

6 }

7

8 d--;

9 if (d * d == n) d--;

10 for (; d >= 1; d--) {

11 if (n % d == 0 && --k == 0) return n / d;

12 }

13 return -1;

14 }

15 };