QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#742134#9622. 有限小数Tom22lWA 265ms3888kbC++231.2kb2024-11-13 15:57:082024-11-13 15:57:11

Judging History

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

  • [2024-11-13 15:57:11]
  • 评测
  • 测评结果:WA
  • 用时:265ms
  • 内存:3888kb
  • [2024-11-13 15:57:08]
  • 提交

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[1000];
int cnt; 
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	for(int i=0;i<=60;i++){
		int fac5=1;
		res[++cnt]=(1ll<<i);
		for(int j=1;j<=21;j++){
			fac5*=5;
			__int128 nw=(__int128)fac5*(1ll<<i);
			if((__int128)nw<=(__int128)(1e17)) res[++cnt]=(int)nw;
		}
	}
	sort(res+1,res+cnt+1);
	int T=Read();
	for(int t=1;t<=T;t++){
		int a=Read(),b=Read();
		if(a>10000&&t==34) cout<<a <<' '<<b;
		if(a>10000) continue;
		int ansa=b-a,ansb=b;
		int x=b;
		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((__int128)a*res[i]>1e18) continue; 
			int nw=a*res[i];
			int c=x-nw%x;
			int g=__gcd(c,b*res[i]);
			if((__int128)((__int128)b*(__int128)res[i])>(__int128)((__int128)1000000000*(__int128)g)) continue;
			if(c/g<ansa){
				ansa=c/g;
				ansb=b*res[i]/g;
			}
		}
		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: 1ms
memory: 3888kb

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: 0
Accepted
time: 200ms
memory: 3824kb

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 54272
1 60
1 7
1 231680000
23 3936
1 36096000
5 326
1 63360
0 1
1 31232
0 1
1 4880
1 10750
1 18500
1 11714560
1 331250
1 2944
1 31
1 6
1 289600000
1 455000
1 58880
1 51840
0 1
1 304
0 1
1 415
1 19328000
1 765000000
1 4640
1 608
1 72192
3 775
1 48
3 347500
1 944
1 43600
1 76
1 430000
1 6336
1 ...

result:

ok 10000 case(s)

Test #3:

score: 0
Accepted
time: 265ms
memory: 3804kb

input:

10000
649 915
163 504
53 235
130 131
109 475
214 757
719 788
479 975
515 811
367 972
69 221
21 44
53 157
77 398
227 332
38 87
145 976
396 403
203 381
675 838
157 309
827 962
17 56
455 654
377 809
605 908
907 929
631 978
286 621
289 462
425 428
139 144
259 368
623 642
767 773
32 281
235 624
88 871
39...

output:

1 11712
1 630
1 192512
1 131
1 95
9 19379200
1 15760
7 9750
33 129760000
1 199065600
1 3536
1 44
2 98125
9 31840
1 66400
1 1392
1 9994240
4 31484375
1 243840
9 838000
1 98880000
3 4925440
1 14
1 10464000
17 2071040
1 2270000
4 2903125
7 1222500
31 79488
17 288750
1 107000
1 288
1 115
1 64200000
6 77...

result:

ok 10000 case(s)

Test #4:

score: -100
Wrong Answer
time: 25ms
memory: 3804kb

input:

10000
92916 121039
44812 49081
648307 724965
758916 780077
99256 205723
326746 382303
288096 996145
218860 951883
12801 35014
128665 169196
201524 298553
448151 688549
68962 180601
834591 924280
492975 701087
54245 64901
335012 440951
264723 555529
178065 246602
48529 77438
549077 578801
406123 4154...

output:

1561 99166250
33 986
65623 4074243997 28475520
61 16599040
341 424591360
5294 137899375
533681 817460480
67 66064000
893 87595000
855 344375296
9814 142479375
24057 750389000
1487 8439250
4017 193606250
93139 62215920
127 7458560
1 34640
21 758579200
131 743526400
827 502527500
2399 1208440
5031 503...

result:

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