2501 약수 구하기

#include <vector>
#include <iostream>

using namespace std;

int main() {
    int N, K;
	cin >> N >> K;

	vector<int> div;
	int flagNum = 1;

	while (N >= flagNum) {
		if (N % flagNum == 0)
			div.emplace_back(flagNum);
		++flagNum;
	}
	
	if (K > div.size()) {
		cout << 0;
	}
	else {
		cout << div[K - 1];
	}

    return 0;
}