QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#750814 | #9622. 有限小数 | ucup-team2179# | WA | 11ms | 3560kb | C++20 | 1.1kb | 2024-11-15 16:02:58 | 2024-11-15 16:02:59 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
#define db double
#define pii pair<int, int>
#define ll long long
using namespace std;
void solve() {
int a, b;
cin >> a >> b;
int bb = b;
while(bb % 2 == 0)
bb /= 2;
while(bb % 5 == 0)
bb /= 5;
if(bb == 1){
cout << "0 1\n";
return;
}
vector<pii> v;
int k = 1;
while(1){
int kk = k;
while(1){
int d = kk * b, c = bb - kk * a % bb;
v.push_back(make_pair(c, d));
kk *= 5;
if(kk > 1e9)
break;
}
k *= 2;
if(k > 1e9)
break;
}
int ans1 = 1e9, ans2 = 0;
for(auto [c, d] : v){
if(c < ans1){
ans1 = c;
ans2 = d;
}
else if(ans1 == c && ans2 > d)
ans2 = d;
}
cout << ans1 << " " << ans2 << '\n';
}
signed main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t = 1;
cin >> t;
while (t--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3488kb
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: 11ms
memory: 3560kb
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 3 2086400000 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 1 1 415 1 19328000 1 765000000 1 4640 1 608 1 72192 3 24800 1 192 1 3558400000 1 944 1 43600 1 1520 ...
result:
wrong answer Integer 2086400000 violates the range [1, 10^9]