QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#743329 | #9622. 有限小数 | TauLee01# | TL | 0ms | 3604kb | C++17 | 1.2kb | 2024-11-13 18:57:10 | 2024-11-13 18:57:11 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42;
#define endl '\n'
#endif
#define int long long
void solve() {
int a, b;
cin >> a >> b;
__int128 d = 1;
d = b;
while (b % 2 == 0)
{
b = b / 2;
}
while (b % 5 == 0)
{
b = b / 5;
}
__int128 u = d;
int ansc = 1e9;
int ansd = 1e9;
__int128 aa = 1;
for (int i = 1; i < 100; i++)
{
__int128 tep = u;
if (tep > (aa << 124)) break;
for (int j = 1; j <= 50; j++)
{
if (tep > (aa << 124)) break;
__int128 nowc = b - (a * (tep / d)) % b;
nowc = nowc % b;
__int128 gc = __gcd(nowc, tep);
if (nowc / gc < ansc && tep / gc <= 1e9)
{
ansc = nowc / gc;
ansd = tep / gc;
}
tep = tep * 5;
}
u = u * 2;
}
cout << ansc << " " << ansd << '\n';
}
signed main()
{
ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
int __; cin >> __;
while (__--) {
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3604kb
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
Time Limit Exceeded
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 7 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 1484375 0 1 1 415 1 235937500 1 765000000 1 181250 1 2968750 1 4406250 3 775 1 48 3 347500 1 94...