POJ 2773 互素问题

Happy 2006

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 14071		Accepted: 4973

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

题意：求与m互素的第k个数

PS：由于GCD（a*t+b,a)=GDC(b,a),因此互素的数具有周期性，在进行输出的时候要注意。不理解看代码应该没问题。

思路：通过欧几里得求出与m互质的数存储在一个数组中，考虑周期问题 进行输出即可。

代码：

#include<cstdio>
using namespace std;
const int maxn=1000008;
int a[maxn];
int gcd(int a,int b)
{
   return b==0? a:gcd(b,a%b);
}
int main()
{
  int m,k,j;
  long long ans;
  while(scanf("%d%d",&m,&k)!=EOF)
  {
      j=0;
      for(int i=1;i<=m;i++)
      if(gcd(m,i)==1)
      {
          a[++j]=i;
      }
      
      if (k % j)
          ans=k/j*m+a[k%j];
        else
            ans=(k/j-1)*m+a[j];
    printf("%lld\n",ans);

  }
  return 0;
}