QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#745937#9622. 有限小数Tggdb#WA 8ms3660kbC++201.0kb2024-11-14 12:31:492024-11-14 12:31:49

Judging History

This is the latest submission verdict.

  • [2024-11-14 12:31:49]
  • Judged
  • Verdict: WA
  • Time: 8ms
  • Memory: 3660kb
  • [2024-11-14 12:31:49]
  • Submitted

answer

#include <bits/stdc++.h>
#define int long long
using namespace std;
constexpr int inf=1e9;
void paralysis(){
	int a,b;
	cin>>a>>b;
	
	int gc=__gcd(a,b);
	if (b%gc==0){
		int res=b/gc;
		while (res%2==0){
			res/=2;
		}
		if (res==1){
			cout<<"0 1\n";
			return;
		}
	}
	
	int tempb=b;
	while (b%2==0){
		b/=2;
	}
	while (b%5==0){
		b/=5;
	}
	int c=tempb-a,d=tempb;
	
	for (int i=0;(1LL<<i)<=inf;i++){
		int base=1;
		while ((1LL<<i)*tempb*base<=inf){
			int nowa=(1LL<<i)*base*a;
			int res=(nowa+b-1)/b*b-nowa;
			if (res<=c){
				if (res==c){
					d=min(d,(1LL<<i)*base*tempb);
				}else{
					d=(1LL<<i)*base*tempb;
				}
				c=res;
//				cout<<d<<"!!\n";
			}		
			
			base*=5;
		}
	}
	

	cout<<c<<" "<<d<<"\n";
}
/*
 4
 1 2
 2 3
 3 7
 19 79
 
 1
 3 6
 
 1
 5 24
 
 1
 262144  524288
 
 1
 5 524288
 
 1
 17 60
 
*/
signed main()
{
	ios::sync_with_stdio(0);
    cin.tie(0);
    
    int t=1;
    cin>>t;
	while (t--){
		paralysis();
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 8ms
memory: 3660kb

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 350
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 160
1 415
1 19328000
1 765000000
1 4640
1 608
1 72192
3 24800
1 192
3 347500
1 944
1 43600
1 1520
1 430000
...

result:

wrong answer Jury found better answer than participant's 1 < 2 (Testcase 321)