QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#742899 | #9622. 有限小数 | yzhx# | WA | 3ms | 3608kb | C++11 | 1.1kb | 2024-11-13 17:36:10 | 2024-11-13 17:36:11 |
Judging History
answer
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
vector<ll> k;
void slove(){
ll up = 1e9;
ll a, b;
cin >> a >> b;
ll pri = b;
while(pri % 2 == 0) pri /= 2;
while(pri % 5 == 0) pri /= 5;
if (pri == 1) {
cout << "0 1\n";
return ;
}
ll mi = pri;
ll low = 0;
for (int i = 0 ; i < k.size() ; i++){
// if (k[i] == 4){
// cout << pri - (a * k[i] % pri);
// }
if (b * k[i] >= up) continue;
if (mi > pri - (a * k[i] % pri)){
mi = pri - (a * k[i] % pri);
low = b * k[i];
}
}
cout << mi << " " << low << endl;
}
int main(){
ll up = 1e9;
for (ll i = 1 ; i <= (ll)1e9 ; i *= 2LL){
ll tmp = i;
while(tmp <= up){
k.push_back(tmp);
tmp *= 5LL;
}
}
// cout << k.size() << endl;
int cnt = 1;
cin >> cnt;
while(cnt--) {
slove();
}
return 0;
}
/*
4
1 2
2 3
3 7
19 79
*/
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3544kb
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: 3ms
memory: 3608kb
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 1 1 61000 0 1 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 1 1 29687500 0 1 1 415 1 235937500 1 765000000 1 181250 1 2968750 1 4406250 3 24800 1 480 3 34...
result:
wrong answer Jury found better answer than participant's 1 < 2 (Testcase 321)