QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#763861 | #9622. 有限小数 | xdz_ | WA | 10ms | 3644kb | C++14 | 1.3kb | 2024-11-19 22:27:25 | 2024-11-19 22:27:32 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define se second
#define fi first
#define endl '\n'
const int N = 1e5 + 10;
bool pan(int x){
while(x % 2 == 0) x /= 2;
while(x % 5 == 0) x /= 5;
if(x == 1) return 1;
else return 0;
}
set<int> res1;
void init(){
vector<int> v2;
v2.push_back(1);
vector<int> v5;
v5.push_back(1);
for(int i=1;;i++){
if(v2[i-1] * 2 <= 1e9){
v2.push_back(v2[i-1] * 2);
}else{
break;
}
}
for(int i=1;;i++){
if(v5[i-1] * 5 <= 1e9){
v5.push_back(v5[i-1] * 5);
}else{
break;
}
}
for(int i=0;i<v2.size();i++){
for(int j=0;j<v5.size();j++){
if(v2[i] * v5[j] <= 1e9){
res1.insert(v2[i] * v5[j]);
}
}
}
}
void solve(){
int a,b;
cin>>a>>b;
int w = pan(b);
if(w == 1){
cout<<"0 1"<<endl;
return ;
}
int ma = 1e9 / b;
int er = 1;
int c = b - a,d = b;
// cout<<c<<endl;
for(auto x : res1){
int jian = a * x;
int k = jian / b;
if(k * b < jian) k ++;
if(b * k - jian < c && x * b <= 1e9){
c = b * k - jian;
d = x * b;
// cout<<x<<" "<<b<<endl;
}
}
cout<<c<<" "<<d<<endl;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
init();
int t;
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: 3576kb
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: 10ms
memory: 3644kb
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 10 600 3 560 1 231680000 23 3936 1 36096000 5 326 1 63360 0 1 1 31232 0 1 1 4880 1 10750 2 37000 1 11714560 1 331250 1 2944 1 31 1 6 1 289600000 1 455000 1 58880 1 51840 0 1 2 608 0 1 1 415 1 19328000 1 765000000 1 181250 1 608 1 72192 12 99200 1 12000 3 347500 1 944 1 43600 6 38000 1 4...
result:
wrong answer Jury found better answer than participant's 1 < 10 (Testcase 3)