POJ 2773 Happy 2006 【gcd的性质（也可用欧拉函数）】

Description

Two positive integers are said to be relatively prime to each other if the Great Common Divisor (GCD) is 1. For instance, 1, 3, 5, 7, 9…are all relatively prime to 2006.

Now your job is easy: for the given integer m, find the K-th element which is relatively prime to m when these elements are sorted in ascending order.

Input
The input contains multiple test cases. For each test case, it contains two integers m (1 <= m <= 1000000), K (1 <= K <= 100000000).

Output
Output the K-th element in a single line.

Sample Input
2006 1
2006 2
2006 3

Sample Output
1
3
5

这个我之前一直用的欧拉函数，一知半解的情况下解决了这道题目，直到今天发现小伙伴的代码很短，看了看后再次感受到了这个世界深深的恶意。。

思路&#x