QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#747812 | #9622. 有限小数 | guodong# | WA | 5ms | 3884kb | C++17 | 1.0kb | 2024-11-14 18:21:04 | 2024-11-14 18:21:04 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define rep(x, l, r) for(int x = l; x <= r; x++)
using namespace std;
typedef long long ll;
const int oo=1e9;
int pw2[105], pw5[105];
const int INF = 0x3f3f3f3f;
const ll XX = 1ll << 30;
signed main(){
int t;
scanf("%lld", &t);
while(t--){
int a, b, res = 1;
scanf("%lld%lld", &a, &b);
while(b % 2 == 0){
res = res * 2;
b /= 2;
}
while(b % 5 == 0){
res = res * 5;
b /= 5;
}
// printf(" %lld %lld\n", a, b);
int ans = INF;
ll s = 1, ans2;
rep(i, 0, 20){
ll ss = s;
rep(j, 0, 10){
if(s*ss*b>oo)break;
if(b-((a*s*ss-1)%b+1)<ans){
ans=b-((a*s*ss-1)%b+1);
ans2=s*ss*b;
}
ss = ss * 5;
}
s = s * 2;
}
printf("%lld %lld\n", ans, ans2);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3752kb
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: 5ms
memory: 3884kb
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 54272 1 3 1 21875 2 463360000 23 960937500 2 72192000 7 333824000 2 126720 0 1 2 122000 0 1 1 4880 1 5375 1 9250000 1 11714560 1 53000000 1 898437500 1 31 1 3 2 579200000 2 910000 1 115000000 1 1265625 0 1 2 1484375 0 1 1 415 1 235937500 1 765000000 1 90625 2 296875 2 8812500 3 198400 1 15 3 3...
result:
wrong answer The result is not terminating.(Testcase 3)