QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#741997#9622. 有限小数Tom22lWA 6ms3772kbC++231.0kb2024-11-13 15:36:302024-11-13 15:36:42

Judging History

This is the latest submission verdict.

  • [2024-11-13 15:36:42]
  • Judged
  • Verdict: WA
  • Time: 6ms
  • Memory: 3772kb
  • [2024-11-13 15:36:30]
  • Submitted

answer

#include<bits/stdc++.h>
#define int long long
using namespace std;
int Read(){
	int x=0;
	char ch=getchar();bool f=0;
	while(ch<'0'||ch>'9') if(ch=='-')f=1,ch=getchar(); else if(ch==EOF)return 0; else ch=getchar();
	while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	return f?-x:x;
}
int res[300];
int cnt; 
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	for(int i=0;i<=29;i++){
		int fac5=1;
		res[++cnt]=(1ll<<i);
		for(int j=1;j<=12;j++){
			fac5*=5;
			int nw=fac5*(1ll<<i);
			if(nw<=1000000000) res[++cnt]=nw;
		}
	}
	sort(res+1,res+cnt+1);
	int T=Read();
	while(T--){
		int a=Read(),b=Read();
		int ansa=b-a,ansb=b;
		int x=b;
		while(a%2==0)a/=2;
		while(a%5==0)a/=5;
		while(x%2==0)x/=2;
		while(x%5==0)x/=5;
		if(x==1){
			printf("0 1\n");
			continue;
		}
		for(int i=1;i<=cnt;i++){
			if(b*res[i]>1000000000) continue;
			int nw=a*res[i];
			int c=(nw/x+1)*x-nw;
			if(c<ansa){
				ansa=c;
				ansb=b*res[i];
			}
		}
		printf("%lld %lld\n",ansa,ansb);
	}
	return 0; 
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 6ms
memory: 3772kb

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 12
1 217088
1 60
1 700
1 231680000
23 12300
1 144384000
5 326
1 63360
0 1
1 31232
0 1
1 78080
1 10750
1 18500
1 143000
1 13250000
1 2944
1 31
1 6
1 579200000
1 455000
1 58880
1 51840
0 1
1 304
0 1
1 415
1 19328000
2 19125
1 116000
1 9728
1 72192
3 992
1 192
3 347500
1 944
1 87200
1 1520
1 215
1 63...

result:

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