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
#include<iostream> #include<stdlib.h> #include<cstdio> #include<algorithm> #include<cstring> #include<queue> #include<math.h> #include<time.h> using namespace std; int p[1000005]; int gcd(int a,int b) { if(b==0) return a; else return gcd(b,a%b); } int main() { int m,k; int a,b; while(cin>>m>>k) { int s=0; for(int i=1;i<=m;i++) { if(gcd(i,m)==1) p[s++]=i; } a=k/s*m+p[k%s-1]; b=(k/s-1)*m+p[s-1]; if(k%s!=0) printf("%d\n",a); else printf("%d\n",b); } return 0; }原文链接：https://blog.csdn.net/hahohehehe/article/details/54698148?ops_request_misc=&request_id=51518984a8464d2982ff13a2ff5af95b&biz_id=&utm_medium=distribute.pc_search_result.none-task-blog-2~blog~koosearch~default-7-54698148-null-null.268%5Ev1%5Econtrol&utm_term=%E6%BE%B3%E6%B4%B2%E7%94%9F%E6%B4%BB
