def acc_int(n):
res =
while n :
res = res
n = n
return res
def digit_by_digit(n): def acc_while_int(n): def enum_int(n):
res = 0 res =
while n > 0: while n > 0: for e in range( n ):
res = res res = res
e
n = n // 10 n = n
return res return res return res
def sum_digit(n): def count_digit(n): def fact(n): def is_prime(n): def find(n):
res = 0 res = 0 res = 1 # assume n >= 2 rng=range(n,-1,-1)
while n > 0: while n > 0: while n > 0: for e in range(2, n): for e in rng:
res = res + (n % 10) res = res + 1 res = res * n if n % e == 0: if is_prime(e):
n = n // 10 n = n // 10 n = n - 1 return False return e
return res return res return res return True return 2