swjtuoj - 2089 Digits' Sum

Digits' Sum

Description

2^15= 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
Give you a integer N
now, what is the sum of the digits of the number 2^N ?

Input

Each case is a line, which consists a integer N(0 <= N <= 64).

Output

Print the sum of the digits of the number 2^N.

Sample input

0

15

Sample output

1

26

#include <iostream>
#include "algorithm"
#include "cstdio"
#include "cmath"
#include "cstring"
using namespace std;
int excel[70];
int len(int opp)
{
    int i, sum = 0;
    long long s = 1;
    while(opp--) s *= 2;
    while(s)
    {
        sum += s%10;
        s /= 10;
    }
    return sum;
}
int main()
{   //freopen("1.in", "r", stdin);
    int i, k;
    for(i = 1; i <= 62; i++)
        excel[i] = len(i);
    excel[0] = 1;
    excel[63] = 89;//特殊处理
    excel[64] = 88;
    while(cin>>k) cout<<excel[k]<<endl;
    return 0;
}