QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#745904 | #9622. 有限小数 | Tggdb# | WA | 3ms | 3600kb | C++20 | 1.2kb | 2024-11-14 12:21:00 | 2024-11-14 12:21:04 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std;
constexpr int inf = 1e9;
void paralysis()
{
int a, b;
cin >> a >> b;
int gc = __gcd(a, b);
if (b % gc == 0)
{
int res = b / gc;
while (res % 2 == 0)
{
res /= 2;
}
if (res == 1)
{
cout << "0 1\n";
return;
}
}
int tempb = b;
while (b % 2 == 0)
{
b /= 2;
}
int c = tempb - a, d = tempb;
for (int i = 0; (1 << i) <= 1000000000; i++)
{
if ((1LL << i) * tempb > inf)
{
break;
}
int nowa = (1LL << i) * a;
int res = (nowa + b - 1) / b * b - nowa;
// cout<<nowa<<" "<<(nowa+b-1)/b*b<<" "<<nowa<<" res:"<<res<<"\n";
if (res < c)
{
c = res;
d = (1LL << i) * tempb;
}
}
cout << c << " " << d << "\n";
}
/*
4
1 2
2 3
3 7
19 79
1
3 6
1
5 24
1
262144 524288
1
5 524288
*/
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
cin >> t;
while (t--)
{
paralysis();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
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: 3ms
memory: 3600kb
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 7 240 3 560 31 2965504 23 3936 5 282 5 326 5 3168 0 1 1 31232 0 1 7 1998848 1 44032 4 74 15 143 5 444596224 1 2944 1 31 1 6 9 362 9 186368 5 23552 10 81 0 1 1 304 1 320 3 10878976 11 2473984 5 156672 3 464 1 608 1 72192 15 992 1 192 15 36438016 1 944 3 109 1 19922944 7 22016 1 6336 1 29...
result:
wrong answer Jury found better answer than participant's 1 < 7 (Testcase 3)