QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#738037 | #9622. 有限小数 | MEshooter | WA | 10ms | 3668kb | C++20 | 982b | 2024-11-12 17:32:03 | 2024-11-12 17:32:03 |
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]*five[y] << endl;
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3668kb
input:
4 1 2 2 3 3 7 19 79
output:
0 2 1 3 1 4375 3 316
result:
ok 4 case(s)
Test #2:
score: -100
Wrong Answer
time: 10ms
memory: 3648kb
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 828125000 1 60 1 109375 1 231680000 23 960937500 1 36096000 5 326 1 63360 0 64 1 61000 0 32 1 4880 1 10750 1 18500 1 11714560 1 331250 1 898437500 1 31 1 6 1 289600000 1 455000 1 115000000 1 1265625 0 2 1 29687500 0 160 1 415 1 235937500 1 765000000 1 181250 1 2968750 1 4406250 3 24800 1 480 ...
result:
wrong answer Jury found better answer than participant's 1 < 2 (Testcase 321)