QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#738024 | #9622. 有限小数 | MEshooter | WA | 7ms | 3660kb | C++20 | 981b | 2024-11-12 17:28:22 | 2024-11-12 17:28:22 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 0x3f3f3f3f;
ll two[100], five[100];
void init(){
two[0] = five[0] = 1;
for(int i = 1; i < 32 && two[i-1] < 1e9; i++)
two[i] = two[i-1]*2;
for(int i = 1; i < 32 && five[i-1] < 1e9; i++)
five[i] = five[i-1]*5;
}
ll sub(ll x){
while(x%2 == 0) x /= 2;
while(x%5 == 0) x /= 5;
return x;
}
int main(){
ios :: sync_with_stdio(false);
init();
int T; cin >> T;
while(T--){
ll a, b, b_, x, y, minc = INF;
cin >> a >> b;
b_ = sub(b);
for(int i = 0; i < 32 && b*two[i] <= 1e9; i++){
for(int j = 0; j < 32 && b*two[i]*five[j] <= 1e9; j++){
ll r = a*two[i]*five[j] % b_;
ll c = (b_-r)%b_;
if(minc > c) minc = c, x = i, y = j;
}
}
cout << minc << " " << b*two[x]*two[y] << endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
input:
4 1 2 2 3 3 7 19 79
output:
0 2 1 3 1 112 3 316
result:
ok 4 case(s)
Test #2:
score: -100
Wrong Answer
time: 7ms
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 217088 1 60 1 1120 1 5931008 23 251904 1 2310144 5 326 1 25344 0 64 1 3904 0 32 1 1952 1 688 1 1184 1 4685824 1 3392 1 94208 1 31 1 6 1 2965504 1 11648 1 188416 1 5184 0 2 1 19456 0 160 1 166 1 154624 1 1253376 1 1856 1 4864 1 18048 3 3968 1 192 3 8896 1 944 1 3488 1 608 1 44032 1 6336 1 2918...
result:
wrong answer The result is not terminating.(Testcase 2)