QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #99930 | #5253. Denormalization | cardinal_city# | WA | 1058ms | 68820kb | Python3 | 606b | 2023-04-24 04:17:51 | 2023-04-24 04:17:52 |
Judging History
answer
import sys
from fractions import Fraction
import math
input = sys.stdin.readline
n = int(input())
a = []
for i in range(n):
a.append([float(input()), i])
a.sort()
mn = a[0][0]
denom_lcm = 1
for i in range(n):
a[i][0] /= mn
a[i][0] = Fraction(a[i][0]).limit_denominator(10000)
#print(a[i][0])
denom_lcm = math.lcm(denom_lcm, a[i][0].denominator)
for i in range(n):
a[i][0] *= denom_lcm
a[i][0] = a[i][0].numerator
assert(a[i][0] <= 10000)
b = [0] * n
for i in range(n):
b[a[i][1]] = a[i][0]
print("\n".join(map(str, b)))
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 25ms
memory: 9524kb
input:
2 0.909840249060 0.414958698174
output:
9665 4408
result:
ok good solution
Test #2:
score: 0
Accepted
time: 23ms
memory: 9356kb
input:
3 0.005731604132 0.696198848562 0.717826101486
output:
75 9110 9393
result:
ok good solution
Test #3:
score: 0
Accepted
time: 40ms
memory: 9344kb
input:
10 0.338936215010 0.390914583549 0.048893426174 0.446152513833 0.137891103101 0.017985796057 0.459132554353 0.201452557127 0.362800863500 0.358493585479
output:
5823 6716 840 7665 2369 309 7888 3461 6233 6159
result:
ok good solution
Test #4:
score: 0
Accepted
time: 15ms
memory: 9532kb
input:
100 0.027828573352 0.034289446708 0.021442608673 0.002752893865 0.091163859407 0.180717182268 0.012097751269 0.101332712254 0.087249881055 0.112643922419 0.016667180541 0.108449036530 0.050488448020 0.104216696303 0.120734059490 0.090096410766 0.066537631979 0.046668105514 0.174836851156 0.084908984...
output:
1486 1831 1145 147 4868 9650 646 5411 4659 6015 890 5791 2696 5565 6447 4811 3553 2492 9336 4534 5302 193 5082 58 1438 4729 3774 542 5876 1641 5574 1443 9374 7710 9570 1413 3054 396 2768 8066 1774 1546 9548 1546 8339 411 3862 3496 3418 8165 4760 7829 4709 8174 8816 4396 7811 8148 2957 1239 1857 4361...
result:
ok good solution
Test #5:
score: -100
Wrong Answer
time: 1058ms
memory: 68820kb
input:
10000 0.014153431495 0.006246805276 0.014846752535 0.008905976745 0.012146085543 0.003020528319 0.010107617948 0.005218062088 0.014054879627 0.009239669913 0.008637984822 0.013371932468 0.009493829995 0.005771335736 0.002264963994 0.010799210007 0.015999982294 0.014564928771 0.001206828144 0.0056243...
output:
339069420920396022335645413834051774303398223809430189408701877896948308894402356402407926327890692904270148406498400955219692510235195914347527018362250934777697764325654832875421145099341377585267716699924841842991010240532815799348274415263962653514710881784433352554112005215141264849331023929291...
result:
wrong output format Expected integer, but "339069420920396022335645413834...2831369841201482044263790720000" found