Happy 2006 poj2773

Happy 2006

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 9049		Accepted: 3031

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<stdio.h>
 #include<string.h>
 #include<stdlib.h>
 #include<math.h>
 #include<iostream>
 #include<algorithm>
 using namespace std;
 #define maxn 10000010
 bool a[maxn];
 int euler(int n)
 {
     int i,j,m=n,ann=n;
     memset(a,,sizeof(a));
     int size=sqrt(m+0.5);
     for(i=; i<=size; i++)
     {
         if(n%i==)
         {
             ann=ann/i*(i-);
             for(j=i; j<=m; j+=i)a[j]=;
             while(n%i==)n/=i;
         }
     }
     if(n>)
     {
         ann=ann/n*(n-);
         for(j=n; j<=m; j+=n)a[j]=;
     }
     return ann;
 }
 int main()
 {
     int n,k,i,m,t,q;
     while(~scanf("%d%d",&n,&k))
     {
         m=euler(n);
         if(k%m==)
         {
            t=k/m-;
         }else t=k/m;
         k=k-m*t;
         q=;
         for(i=;i<=n;i++)
         {
             if(!a[i])q++;
             if(q==k)break;
         }
         printf("%lld\n",(long long)i+n*t);
     }
 }