QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#739382#9622. 有限小数startdWA 182ms3688kbC++141.4kb2024-11-12 21:36:362024-11-12 21:36:38

Judging History

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

  • [2024-11-12 21:36:38]
  • 评测
  • 测评结果:WA
  • 用时:182ms
  • 内存:3688kb
  • [2024-11-12 21:36:36]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
int ttt;
int a,b;
int exgcd(int a,int b,int &x,int &y){
	if(b==0){
		x=1;
		y=0;
		return a;
	}
	return exgcd(b,a%b,y,x);
	y-=a/b*x;
}
int updiv(int a,int b) {
	return (a+b-1)/b;
}
int downdiv(int a,int b) {
	return a/b;
}
signed main() {
	cin>>ttt;
	while(ttt--) {
		cin>>a>>b;
		int ans_c=1000000000,ans_d=1000000000;
		int g=__gcd(a,b);
		a/=g;
		b/=g;
		int x=b;
		while(x%2==0) x/=2;
		while(x%5==0) x/=5;
		if(x==1) {
			cout<<"0 1"<<endl;
			continue;
		}
		for(int p2=1;p2<=1e9;p2*=2) {
			for(int p5=1;p5<=1e9;p5*=5) {
				int d=x*p2*p5;
				int c,k;
				int g=exgcd(x,b/x,k,c);
				if((a*p2*p5)%g==0) {
					k*=(a*p2*p5)/g;
					c*=(a*p2*p5)/g;
					int dc=x/g,dk=(b/x)/g;
					if(c>=0) {
						int t=updiv(c,dc);
						c-=dc*t;
						k+=dk*t;
						if(c==0) {
							c-=dc;
							k+=dk;
						}
					}
					if(k<0) continue;
					int t=min(downdiv(-c,dc),downdiv(k,dk));
					
					c+=dc*t;
					k-=dk*t;
					if(c==0) {
						c-=dc;
						k+=dk;
					}
					int g_=__gcd(-c,d);
					if((-c/g_<ans_c)&&(d/g_<=1e9)) {
						ans_c=-c/g_;
						ans_d=d/g_;
					}
					else if((-c/g_==ans_c)&&(d/g_<=1e9)&&(d/g_<ans_d)) {
						ans_c=-c/g_;
						ans_d=d/g_;
					}
				}
			}
		}
		cout<<ans_c<<' '<<ans_d<<endl;
	}
	return 0;
}
/*
4
1 2
2 3
3 7
19 79
*/

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3688kb

input:

4
1 2
2 3
3 7
19 79

output:

0 1
1 3
1 14
3 316

result:

ok 4 case(s)

Test #2:

score: -100
Wrong Answer
time: 182ms
memory: 3564kb

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 54272
1 1
1 70
1 -205772752303423488
23 3936
1 36096000
5 326
1 63360
0 1
1 31232
0 1
1 4880
1 1
1 1
1 11714560
1 331250
1 2944
1 31
1 1
1 289600000
1 455000
1 58880
1 51840
0 1
1 1
0 1
1 415
1 19328000
1 765000000
1 1
1 608
1 72192
3 6200
1 1
3 347500
1 944
1 43600
1 1
1 430000
1 6336
1 29184...

result:

wrong answer The result is not terminating.(Testcase 3)