Countable Rational Numbers

 

 

 

 

 

 

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
  
using namespace std;
typedef long long ll;
const ll maxn=1000005;
int prime[maxn/10],phi[maxn];
bool vis[maxn];
int tot;
  
inline int gcd(int a,int b){
    return b==0?a:gcd(b,a%b);
}
  
void init()
{
    phi[1]=1;
    for (ll i=2; i<maxn; ++i)
    {
        if (!vis[i])
        {
            prime[tot++]=i;
            phi[i]=i-1;
        }
        for (ll j=0; j<tot&&1ll*prime[j]*i<maxn; j++)
        {
            vis[prime[j]*i]=1;
            if(i%prime[j]==0)
            {
                phi[prime[j]*i]=phi[i]*prime[j];
                break;
            }
            phi[prime[j]*i]=phi[i]*phi[prime[j]];
        }
    }
}
  
inline bool check(ll xx,ll yy,ll x,ll y)
{
    if(max(abs(xx),abs(yy))!=max(abs(x),abs(y)))
    {
        return max(abs(xx),abs(yy))<max(abs(x),abs(y));
    }
    if(yy!=y)
    {
        return yy<y;
    }
    return xx*yy>x*y;
}
  
int main()
{
    init();
    ll _;
    scanf("%lld",&_);
    ll x,y;
    ll k;
    ll ans=0;
    while (_--)
    {
        ll xx,yy;
        ans=0;
        scanf("%lld%lld",&y,&x);
        if(y==0&&x==1){
            printf("2\n");
            continue;
        }
        if (x<=0||x*y==0||gcd(x,abs(y))!=1)
        {
            printf("0\n");
            continue;
        }
        if(max(x,abs(y))<=2)
        {
            if(x==2&&y==1)
            {
                puts("6");
            }
            else if(x==1&& y==2)
            {
                puts("7");
            }
            else if(x==1 &&y==1)
            {
                puts("3");
            }
            else if(x==1&&y==0)
            {
                puts("2");
            }
            else if(x==1&&y==-1)
            {
                puts("1");
            }
            else if(x==2&& y==-1)
            {
                puts("5");
            }
            else if(x==1&&y==-2)
            {
                puts("4");
            }
            continue;
        }
  
        k=max(x,abs(y));
        if (k>=3)
        {
            ans=3;
            for(ll i=2; i<=k-1; ++i)
                ans+=4*phi[i];
        }
        for (ll i=1; i<=k; ++i)
        {
            if (i>1&&k%i==0) continue;
            xx=k;
            yy=i;
            if (gcd(xx,yy)==1&&check(xx,yy,x,y))
                ans++;
            xx=k;
            yy=-i;
            if (gcd(xx,abs(yy))==1&&check(xx,yy,x,y))
                ans++;
  
            yy=k;
            xx=i;
            if (gcd(xx,yy)==1&&check(xx,yy,x,y))
                ans++;
  
            yy=-k;
            xx=i;
            if (gcd(xx,abs(yy))==1&&check(xx,yy,x,y))
                ans++;
        }
        printf("%lld\n",ans+1);
    }
    return 0;
}

  

 

posted @   Snow_in_winer  阅读(172)  评论(0编辑  收藏  举报
努力加载评论中...
点击右上角即可分享
微信分享提示