<doocs>1134.Armstrong Number_1.py
def isArmstrong( n: int) -> bool:
    k = len(str(n))
    s, t = 0, n
    while t:
        t, v = divmod(t, 10)
        s += pow(v, k)
    return n == s
def sample_funcname ( var_0 : int ) -> bool :
    var_5 = len ( str ( var_0 ) )
    var_7 , var_8 = 0 , var_0
    while var_8 :
        var_8 , var_11 = divmod ( var_8 , 10 )
        var_7 += pow ( var_11 , var_5 )
    return var_0 == var_7
