题面: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
Output
1
3
5
题目大意:给定整数m,求与其互质的第k个数
思路:首先看数据范围 K (1 <= K <= 100000000),意味着暴力求解会超时。
这时候就需要我们用到一些数学定理。
在九章算术中提到更相减损术:任意a, b为正整数,有gcd(a, b) = gcd(a, b - a);
推论:gcd(b, a + b * t) = gcd(b, a);
接下来摘自https://blog.csdn.net/Young_12138/article/details/54696032
故设m为正整数,所以与m互素的数对m取模具有周期性;设小于m的且与m互素的数有t个,其中第i个是a[i],则第t * ? + i个与m互素的数是m * ? + a[i](?表示周期数 - 1)
所以我们只需要遍历1~m求出周期大小,并将其用数组储存起来;然后,求出周期,带入推导出来的公式就可以了
另外要特别注意k mod cnt= 0的情况下,此时周期数(u值)应该-1,余项(v值 )应该等于周期大小
AC代码:
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long LL;
const int N = 1e6;
int p[N + 5];
int m, k, cnt;
int gcd(int a, int b)
{
return b ? gcd(b, a % b) : a;
}
int main()
{
while(cin >> m >> k)
{
cnt = 0;
for(int i = 1; i <= m; ++i)
{
if(gcd(i, m) == 1)
p[++cnt] = i;
}
int u, v;
u = k % cnt ? k / cnt : k / cnt - 1;
v = k % cnt ? k % cnt : cnt;
printf("%d\n", m * u + p[v]);
}
return 0;
}