QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#766592 | #9622. 有限小数 | lonely_log# | WA | 205ms | 3456kb | C++17 | 973b | 2024-11-20 17:53:22 | 2024-11-20 17:53:24 |
Judging History
answer
#include<bits/stdc++.h>
#define i64 long long
#define i128 __int128
#define Mod 998244353
const int INF = 1000000000;
i64 gcd(i64 a,i64 b){
return b == 0 ? a : gcd(b,a % b);
}
i64 a,b;
void solve(){
std::cin >> a >> b;
i64 _b = b;
while(_b % 2 == 0)
_b >>= 1;
while(_b % 5 == 0)
_b /= 5;
if(_b == 1){
std::cout << "0 1\n";
return ;
}
i64 c = INF;
i64 d = INF;
for(i128 i = 1; i * _b <= 1e18 ; i *= 2){
for(i128 j = 1; i * j * _b <= 1e18; j *= 5){
i64 x = i * j * a % _b;
i64 g = gcd(_b - x,_b * i * j);
if(c > (_b - x) / g && _b * i * j / g <= 1e9)
c = (_b - x) / g,d = _b * i * j / g;
}
}
std::cout << c << ' ' << d << '\n';
return ;
}
int main(){
std::ios::sync_with_stdio(0);
std::cin.tie(0); std::cout.tie(0);
int tes;
std::cin >> tes;
while(tes--)
solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3404kb
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: 205ms
memory: 3456kb
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 828125000 1 3 1 21875 1 231680000 23 960937500 1 36096000 5 326 1 63360 0 1 1 61000 0 1 1 4880 1 5375 1 9250 1 11714560 1 331250 1 898437500 1 31 1 3 1 289600000 1 455000 1 115000000 1 1265625 0 1 1 14843750 0 1 1 415 1 235937500 1 765000000 1 90625 1 2968750 1 4406250 3 6200 1 15 3 347500 1 9...
result:
wrong answer The result is not terminating.(Testcase 3)