QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#758755 | #9622. 有限小数 | xuxin12345 | WA | 163ms | 3560kb | C++14 | 1.1kb | 2024-11-17 19:35:38 | 2024-11-17 19:35:38 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
__int128_t p2arr[31], p5arr[14];
void init_pow()
{
p2arr[0] = 1;
p5arr[0] = 1;
for (int i = 1; i < 31; i++)
{
p2arr[i] = 2 * p2arr[i - 1];
}
for (int i = 1; i < 14; i++)
{
p5arr[i] = 5 * p5arr[i - 1];
}
}
void sol()
{
int a, b;
cin >> a >> b;
int s2 = 0, s5 = 0;
while (b % 2 == 0)
{
s2++, b /= 2;
}
while (b % 5 == 0)
{
s5++, b /= 5;
}
set<pair<int, int>> ansp;
for (int p2 = 0; p2 < 31; p2++)
{
for (int p5 = 0; p5 < 14; p5++)
{
__int128_t num = p2arr[p2] * p5arr[p5];
__int128_t fm = b * num * p2arr[s2] * p5arr[s5];
__int128_t fz = (b - a * num % b) % b;
if (fm > 1e9)
continue;
ansp.insert({int(fz), int(fm)});
}
}
auto [cc, dd] = *ansp.begin();
cout << cc << " " << dd << "\n";
}
int32_t main()
{
init_pow();
int T;
cin >> T;
while (T--)
{
sol();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3560kb
input:
4 1 2 2 3 3 7 19 79
output:
0 2 1 3 1 14 3 316
result:
ok 4 case(s)
Test #2:
score: -100
Wrong Answer
time: 163ms
memory: 3504kb
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 5 326 1 63360 0 64 1 31232 0 32 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 2 1 304 0 160 1 415 1 19328000 1 765000000 1 4640 1 608 1 72192 3 24800 1 192 3 347500 1 944 1 43600 1 1520 1 43000...
result:
wrong answer Jury found better answer than participant's 1 < 2 (Testcase 321)