762A - k-th divisor - CodeForces Solution


math number theory *1400

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;

int main()
{
	long long n,k,d;
	set<long long> a;
	cin>>n>>k;
	for(d=1;d*d<=n;d++)if(n%d==0)a.insert({d, n/d});
	if(k<=a.size())cout<<*next(a.begin(),k-1);else cout<<-1;
}
    	  		 	 		 	 	   	   	


Comments

Submit
0 Comments
More Questions

Cutting a material
Bubble Sort
Number of triangles
AND path in a binary tree
Factorial equations
Removal of vertices
Happy segments
Cyclic shifts
Zoos
Build a graph
Almost correct bracket sequence
Count of integers
Differences of the permutations
Doctor's Secret
Back to School
I am Easy
Teddy and Tweety
Partitioning binary strings
Special sets
Smallest chosen word
Going to office
Color the boxes
Missing numbers
Maximum sum
13 Reasons Why
Friend's Relationship
Health of a person
Divisibility
A. Movement
Numbers in a matrix