QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#262672 | #885. Keep Calm And Carry Off | Fyind# | WA | 9ms | 8236kb | Python3 | 976b | 2023-11-23 21:28:56 | 2023-11-23 21:28:58 |
Judging History
answer
x = int(input())
y = int(input())
lenx = len(str(x))
leny = len(str(y))
ss = x + y
sumstr = str(ss)[::-1]
sumlen = len(sumstr)
xstr = str(x)[::-1]
xstr = xstr.ljust(sumlen, "0")
ystr = str(y)[::-1]
ystr = ystr.ljust(sumlen, "0")
pos = -1
for i in range(sumlen):
if (int(xstr[i]) + int(ystr[i]) != int(sumstr[i])):
pos = i
# print(xstr[i], ystr[i], sumstr[i])
if pos == -1:
print(0)
else:
ans = min(x, y)
ansxstr = ("0" * pos) + str(int(xstr[pos]) + 1)
if pos < sumlen:
ansxstr += xstr[pos + 1:]
# ansxstr = ansxstr[:str(x).__len__()]
# print(ansxstr)
revx = int((ansxstr[::-1])[:lenx])
ans = min(ans, abs(x - revx))
ansystr = ("0" * pos) + str(int(ystr[pos]) + 1)
if pos < sumlen:
ansystr += ystr[pos + 1:]
# ansystr = ansystr[:str(y).__len__()]
# print(ansystr)
revy = int((ansystr[::-1])[:leny])
ans = min(ans, abs(y - revy))
print(ans)
詳細信息
Test #1:
score: 0
Wrong Answer
time: 9ms
memory: 8236kb
input:
10 99
output:
0
result:
wrong answer expected '1', found '0'