QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#758936#9622. 有限小数woodie_0064#WA 8ms3616kbC++201003b2024-11-17 20:31:442024-11-17 20:31:54

Judging History

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

  • [2024-11-17 20:31:54]
  • 评测
  • 测评结果:WA
  • 用时:8ms
  • 内存:3616kb
  • [2024-11-17 20:31:44]
  • 提交

answer

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll D = 1e9;
ll exgcd(ll a, ll b, ll &x, ll &y) {
	if(b == 0) {
		x = 1;
		y = 0;
		return a;
	}
	ll d = exgcd(b, a % b, x, y);
	ll t = x;
	x = y;
	y = t - a / b * y;
	return d;
}
ll inv(ll a, ll p) {
	ll x, y;
	exgcd(a, p, x, y);
	return (x % p + p) % p;
}
void work(){
	ll a, b;
	cin >> a >> b;
	ll d = 1;
	while(b % 2 == 0) {
		b /= 2;
		d *= 2;
	}
	while(b % 5 == 0) {
		b /= 5;
		d *= 5;
	}
	a = 1ll * a * inv(d, b) % b;
	ll ansc = b, ansd = 1;
	for(ll i = 0, x = 1; x <= D; i++, x *= 2) {
		for(ll j = 0, y = 1; y <= D / x; j++, y *= 5) {
			ll t = 1ll * a * x % b * y % b;
			if(t) {
				t = b - t;
			}
			if(t < ansc) {
				ansc = t;
				ansd = b * x * y;
			}
		}
	}
	cout << ansc << ' ' << ansd << '\n';
}


int main(){
//	freopen("test.txt", "r", stdin);
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T;
	cin >> T;
	while(T--){
		work(); 
	}	
	return 0;
}

詳細信息

Test #1:

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

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

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
1 15
1 7
1 231680000
23 60058593750
1 2203125000
3 2086400000
1 63360
0 1
1 61000
0 1
1 59570312500
1 10750
1 18500
1 1117187500
1 331250
1 11230468750
1 31
1 15
1 289600000
1 455000
1 17968750000
1 1265625
0 1
1 1484375
0 1
1 415
1 235937500
1 765000000
1 181250
1 2968750
1 4406250
...

result:

wrong answer Integer 60058593750 violates the range [1, 10^9]