QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#858097#9622. 有限小数huangceWA 20ms3712kbC++201.3kb2025-01-16 14:06:322025-01-16 14:06:32

Judging History

你现在查看的是最新测评结果

  • [2025-01-16 14:06:32]
  • 评测
  • 测评结果:WA
  • 用时:20ms
  • 内存:3712kb
  • [2025-01-16 14:06:32]
  • 提交

answer

#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define int ll
using namespace std;
constexpr int N=1e6+7;
constexpr int M=2e3+7;
constexpr int inf=1e9;
int a,b;
int exgcd(int a,int b,int &x,int &y)
{
	if(b==0)
	{
		x=1,y=0;
		return a;
	}
	int x1,y1,d;
	d=exgcd(b,a%b,x1,y1);
	x=y1;
	y=x1-(a/b)*y1;
	return d;
}
int p2[40],p5[30];
void init()
{
    p2[0]=p5[0]=1;
    for(int i=1;i<=30;i++)
    {
        p2[i]=p2[i-1]*2;
    }
    for(int i=1;i<=13;i++)
    {
        p5[i]=p5[i-1]*5;
    }
}
void solve()
{
    cin>>a>>b;
    int p=b;
    while(p%5==0) p/=5;
    while(p%2==0) p/=2;
    int yu=b/p;
    if(p==1) return cout<<"0 1"<<endl,void();
    int c=1e18,d=1;
    for(int i=0;i<=30;i++)
    {
        for(int j=0;j<=13;j++)
        {
            int D=p2[i]*p5[j];
            if(D>inf) break;
            if(D*p>inf) break;
            D=((-D*a%p)%p+p)%p;
            int x,y;
            exgcd(yu,p,x,y);
            int ansc=x*D%p;
            int dd=p2[i]*p5[j]*p;
            if(ansc<c)
            {
                c=ansc;
                d=dd;
            }
        }
    }
    cout<<c<<' '<<d<<endl;
}
signed main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    init();
    int T=1; cin>>T;
    while(T--){solve();}
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3712kb

input:

4
1 2
2 3
3 7
19 79

output:

0 1
1 3
1 4375
3 316

result:

ok 4 case(s)

Test #2:

score: -100
Wrong Answer
time: 20ms
memory: 3712kb

input:

10000
11 12
28 53
17 60
2 35
17 181
80 123
68 141
79 163
71 99
13 64
33 61
15 32
16 61
11 86
33 74
128 143
40 53
7 23
30 31
5 6
86 181
73 91
13 23
71 81
1 2
7 38
117 160
33 83
129 151
88 153
25 58
16 19
19 141
95 124
43 96
71 139
11 59
106 109
93 152
34 43
17 99
1 57
20 159
16 25
5 73
159 170
172 17...

output:

1 3
1 828125000
-2 15
1 7
1 231680000
23 960937500
1 36096000
5 326
1 63360
0 1
1 61000
0 1
1 4880
-42 10750
-36 18500
1 11714560
1 331250
1 898437500
1 31
-2 15
1 289600000
1 455000
1 115000000
1 1265625
0 1
-18 1484375
0 1
1 415
1 235937500
1 765000000
-28 181250
1 2968750
1 4406250
3 775
-2 3
3 3...

result:

wrong answer Integer -2 violates the range [0, 10^9]