Submission #5489565


Source Code Expand

A, B = map(str, input().split())
ans = []
ls = [0,1,2,3,4,5,6,7,8,9]
for i in range(3):
    if i == 0:
        for x in ls[1:]:
            a = ''
            a += str(x) + A[1:]
            ans.append(int(a)-int(B))
    elif i == 1:
        for x in ls:
            a = ''
            a += A[0] + str(x) + A[2]
            ans.append(int(a)-int(B))
    else:
        for x in ls:
            a = ''
            a += A[:2] + str(x)
            ans.append(int(a)-int(B))
for i in range(3):
    if i == 0:
        for x in ls[1:]:
            b = ''
            b += str(x) + B[1:]
            ans.append(int(A)-int(b))
    elif i == 1:
        for x in ls:
            b = ''
            b += B[0] + str(x) + B[2]
            ans.append(int(A)-int(b))
    else:
        for x in ls:
            b = ''
            b += B[:2] + str(x)
            ans.append(int(A)-int(b))
print(max(ans))

Submission Info

Submission Time
Task A - A - B problem
User terasak
Language Python (3.4.3)
Score 100
Code Size 921 Byte
Status AC
Exec Time 20 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 45
Set Name Test Cases
Sample sample_0.txt, sample_1.txt, sample_2.txt
All ansneg_0.txt, ansneg_1.txt, ansneg_2.txt, ansneg_3.txt, ansneg_4.txt, ansneg_5.txt, ansneg_6.txt, ansneg_7.txt, ansneg_8.txt, ansneg_9.txt, handmade_0.txt, handmade_1.txt, random_0.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, sample_0.txt, sample_1.txt, sample_2.txt, top2fixed_0.txt, top2fixed_1.txt, top2fixed_2.txt, top2fixed_3.txt, top2fixed_4.txt, top2fixed_5.txt, top2fixed_6.txt, top2fixed_7.txt, top2fixed_8.txt, top2fixed_9.txt, topfixed_0.txt, topfixed_1.txt, topfixed_2.txt, topfixed_3.txt, topfixed_4.txt, topfixed_5.txt, topfixed_6.txt, topfixed_7.txt, topfixed_8.txt, topfixed_9.txt
Case Name Status Exec Time Memory
ansneg_0.txt AC 17 ms 3064 KB
ansneg_1.txt AC 19 ms 3064 KB
ansneg_2.txt AC 18 ms 3064 KB
ansneg_3.txt AC 18 ms 3064 KB
ansneg_4.txt AC 17 ms 3064 KB
ansneg_5.txt AC 18 ms 3064 KB
ansneg_6.txt AC 17 ms 3064 KB
ansneg_7.txt AC 18 ms 3064 KB
ansneg_8.txt AC 17 ms 3064 KB
ansneg_9.txt AC 17 ms 3064 KB
handmade_0.txt AC 18 ms 3064 KB
handmade_1.txt AC 17 ms 3064 KB
random_0.txt AC 17 ms 3064 KB
random_1.txt AC 17 ms 3064 KB
random_2.txt AC 17 ms 3064 KB
random_3.txt AC 18 ms 3064 KB
random_4.txt AC 18 ms 3064 KB
random_5.txt AC 18 ms 3064 KB
random_6.txt AC 17 ms 3064 KB
random_7.txt AC 18 ms 3064 KB
random_8.txt AC 17 ms 3064 KB
random_9.txt AC 17 ms 3064 KB
sample_0.txt AC 20 ms 3064 KB
sample_1.txt AC 18 ms 3064 KB
sample_2.txt AC 18 ms 3064 KB
top2fixed_0.txt AC 17 ms 3064 KB
top2fixed_1.txt AC 17 ms 3064 KB
top2fixed_2.txt AC 17 ms 3064 KB
top2fixed_3.txt AC 18 ms 3064 KB
top2fixed_4.txt AC 17 ms 3064 KB
top2fixed_5.txt AC 17 ms 3064 KB
top2fixed_6.txt AC 17 ms 3064 KB
top2fixed_7.txt AC 18 ms 3064 KB
top2fixed_8.txt AC 17 ms 3064 KB
top2fixed_9.txt AC 17 ms 3064 KB
topfixed_0.txt AC 17 ms 3064 KB
topfixed_1.txt AC 17 ms 3064 KB
topfixed_2.txt AC 17 ms 3064 KB
topfixed_3.txt AC 18 ms 3064 KB
topfixed_4.txt AC 18 ms 3064 KB
topfixed_5.txt AC 18 ms 3064 KB
topfixed_6.txt AC 17 ms 3064 KB
topfixed_7.txt AC 18 ms 3064 KB
topfixed_8.txt AC 17 ms 3064 KB
topfixed_9.txt AC 18 ms 3064 KB