In [9]:

    

def solve(n: str) -> int:
    # find high odd
    h = len(n)
    l = len(n)
    for i, d in enumerate(n):
        if int(d) % 2 == 1:
            h = i
            break
    if h == len(n):
        return 0
    # must be minus
    if int(n[h]) == 9:
        return int(n[h:]) - int(str(int(n[h])-1) + '8'*(l-h-1))
    # comp dist. (x+1)00...0, (x-1)88...8
    return min(int(n[h:]) - int(str(int(n[h])-1) + '8'*(l-h-1)),
               (int(n[h])+1) * 10**(l-h-1) - int(n[h:]))


    

In [13]:

    

3787+213


    

    
Out[13]:





4000

In [14]:

    

def main():
    T = int(input())
    for i in range(T):
        res = solve(input())
        print('Case #{}: {}'.format(i+1, res))


    

In [15]:

    

def main():
    T = int(input())
    for i in range(T):
        n, k = map(int, input().split(' '))
        sn = sum(map(float, input().split(' ')))
        # any try is same
        print('Case #{}: {}'.format(i+1, sn/n))


    

    




1
3434
Case #1: 546

In [16]:

    

sum(map(int, ['34', '2']))


    

    
Out[16]:





36

In [ ]:

    

if '__name__' == '__main__':
    main()