QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#262673#885. Keep Calm And Carry OffFyind#WA 7ms8160kbPython31.0kb2023-11-23 21:29:572023-11-23 21:29:59

Judging History

你现在查看的是最新测评结果

  • [2023-11-23 21:29:59]
  • 评测
  • 测评结果:WA
  • 用时:7ms
  • 内存:8160kb
  • [2023-11-23 21:29:57]
  • 提交

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)
    if xstr[pos] == 0:
        lenx += 1
    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)
    if ystr[pos] == 0:
        leny += 1
    revy = int((ansystr[::-1])[:leny])
    ans = min(ans, abs(y - revy))
    print(ans)

詳細信息

Test #1:

score: 0
Wrong Answer
time: 7ms
memory: 8160kb

input:

10
99

output:

0

result:

wrong answer expected '1', found '0'