← Back to List

2501번: 약수 구하기 ↗

Solutions

C++14
181 B | 181 chars
#include <iostream>
using namespace std;
int N,K,C;
int main()
{
	cin>>N>>K;
	for(int x=1; x<=N; x++)
	{
		if(N%x==0) C++;
		if(C==K)
		{
			cout<<x;
			return 0;
		}
	}
	cout<<0;
}