POJ 2229 Sumsets 动态规划

#include <iostream>
#include <cmath>
using namespace std;
int dp[27][1000007], ans, N, M = 1;
int two[28] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 8388608, 16777216, 33554432, 67108864};
void input()
{
    scanf("%d", &N);
    for (int i = 0; i <= 27; i++)
    {
        if (N >= two[i])
        {
            M = i;
        }
        else
        {
            break;
        }
    }
}
void solve()
{
    for (int i = 0; i <= M; i++)
    {
        dp[i][0] = 1;
    }
    for (int i = 1; i <= N; i++)
    {
        dp[0][i] = 1;
    }
    for (int i = 1; i <= M; i++)
    {
        for (int j = 1; j <= N; j++)
        {
            if (j >= two[i])
            {
                dp[i][j] = (dp[i - 1][j] + dp[i][j - two[i]]) % 1000000000;
            }
            else
            {
                dp[i][j] = dp[i - 1][j];
            }
        }
    }
}
int main()
{
    input();
    solve();
    printf("%d\n", (dp[M][N] % 1000000000));
    return 0;
}