Project Euler Problem 16

Python
方法１

def sum_of_digits(n):
    s = 0
    while n != 0:
        n, r = divmod(n, 10)
        s += r
    return s

print(sum_of_digits(2 ** 1000))

方法２

>>> sum(map(int, str(2 ** 1000)))