Submission #3404175


Source Code Expand

A, B = map(str, input().split())
A_ = A
B_ = B
for i in range(3):
    if A[i] != '9':
        A_ = A.replace(A[i], '9', 1)
        break

if B[0] != '1':
    B_ = '1' + B[1:]
elif B[1] != '0':
    B_ = B[0] + '0' + B[2]
else:
    B_ = B[:2] + '0'

print(max(int(A)-int(B_), int(A_)-int(B)))

Submission Info

Submission Time
Task A - A - B problem
User satoshi_f
Language Python (3.4.3)
Score 100
Code Size 305 Byte
Status AC
Exec Time 17 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 17 ms 3064 KB
ansneg_2.txt AC 17 ms 3060 KB
ansneg_3.txt AC 16 ms 3064 KB
ansneg_4.txt AC 17 ms 3060 KB
ansneg_5.txt AC 17 ms 3060 KB
ansneg_6.txt AC 16 ms 3060 KB
ansneg_7.txt AC 17 ms 3064 KB
ansneg_8.txt AC 16 ms 3064 KB
ansneg_9.txt AC 16 ms 3064 KB
handmade_0.txt AC 16 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 3060 KB
random_3.txt AC 17 ms 3064 KB
random_4.txt AC 16 ms 3064 KB
random_5.txt AC 16 ms 3064 KB
random_6.txt AC 16 ms 3064 KB
random_7.txt AC 17 ms 3064 KB
random_8.txt AC 16 ms 3064 KB
random_9.txt AC 17 ms 3064 KB
sample_0.txt AC 17 ms 3064 KB
sample_1.txt AC 17 ms 3064 KB
sample_2.txt AC 17 ms 3064 KB
top2fixed_0.txt AC 17 ms 3060 KB
top2fixed_1.txt AC 17 ms 3064 KB
top2fixed_2.txt AC 17 ms 3064 KB
top2fixed_3.txt AC 17 ms 3060 KB
top2fixed_4.txt AC 16 ms 3064 KB
top2fixed_5.txt AC 17 ms 3064 KB
top2fixed_6.txt AC 17 ms 3064 KB
top2fixed_7.txt AC 16 ms 3064 KB
top2fixed_8.txt AC 16 ms 3060 KB
top2fixed_9.txt AC 17 ms 3060 KB
topfixed_0.txt AC 16 ms 3064 KB
topfixed_1.txt AC 17 ms 3064 KB
topfixed_2.txt AC 17 ms 3064 KB
topfixed_3.txt AC 17 ms 3060 KB
topfixed_4.txt AC 16 ms 3060 KB
topfixed_5.txt AC 16 ms 3064 KB
topfixed_6.txt AC 16 ms 3064 KB
topfixed_7.txt AC 16 ms 3064 KB
topfixed_8.txt AC 17 ms 3064 KB
topfixed_9.txt AC 17 ms 3060 KB