UVA - 11327

UVA - 11327
https://vjudge.net/problem/28358/origin
求欧拉函数的前缀和，二分查找到那个位置，再从它开始暴力gcd找

#include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#define inf 2147483647
#define N 1000010
#define p(a) putchar(a)
#define For(i,a,b) for(long long i=a;i<=b;++i)
 
using namespace std;
long long n,cnt;
long long a[N];
void in(long long &x){
    long long y=;char c=getchar();x=;
    while(c<''||c>''){if(c=='-')y=-;c=getchar();}
    while(c<=''&&c>=''){ x=(x<<)+(x<<)+c-'';c=getchar();}
    x*=y;
}
void o(long long x){
    if(x<){p('-');x=-x;}
    if(x>)o(x/);
    p(x%+'');
}
 
long long gcd(long long a,long long b){
    return a%b==?b:gcd(b,a%b);
}
 
int main(){
    a[]=;
    For(i,,1e6)
        if(!a[i])
            for(long long j=i;j<=1e6;j+=i){
                if(!a[j]) a[j]=j;
                a[j]=a[j]/i*(i-);
            }
    For(i,,1e6)
        a[i]+=a[i-];
    while(cin>>cnt&&cnt){
        n=lower_bound(a+,a++,cnt)-a;
        cnt-=a[n-];
        For(i,,n){
            if(gcd(i,n)==)
                cnt--;
            if(!cnt){
                o(i);p('/');o(n);p('\n');
                break;
            }
        }
    }
    return ;
}