QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#763619 | #9622. 有限小数 | superguymj | TL | 13ms | 10612kb | Python3 | 723b | 2024-11-19 21:14:49 | 2024-11-19 21:14:49 |
Judging History
answer
def func(x):
while x % 2 == 0:
x = x // 2
while x % 5 == 0:
x = x // 5
return x
T = int(input())
for t in range(T):
a, b = map(int, input().split(' '))
p = func(b)
D = []
for i in range(0, 50):
for j in range(0, 50):
if 2 ** i * 5 ** j * p <= 1000000000:
D.append(2 ** i * 5 ** j * p)
for c in range(0, (-a % p + p) % p + 1):
flag = False
for d in D:
n = a * d + c * b
m = func(b * d)
if n % m == 0:
print(c, d)
flag = True
break
if flag:
break
詳細信息
Test #1:
score: 100
Accepted
time: 13ms
memory: 10612kb
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 3 1 828125000 1 15 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 15 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 3 3 347500 1 944...