Milliard Vasya's Function URAL - 1353[简单数位DP]

1353. Milliard Vasya's Function

Time limit: 1.0 second
Memory limit: 64 MB

Vasya is the beginning mathematician. He decided to make an important contribution to the science and to become famous all over the world. But how can he do that if the most interesting facts such as Pythagor’s theorem are already proved? Correct! He is to think out something his own, original. So he thought out the Theory of Vasya’s Functions. Vasya’s Functions (VF) are rather simple: the value of the  N th VF in the point  S is an amount of integers from 1 to  N that have the sum of digits  S. You seem to be great programmers, so Vasya gave you a task to find the milliard VF value (i.e. the VF with  N = 10 9) because Vasya himself won’t cope with the task. Can you solve the problem?

Input

Integer  S (1 ≤  S ≤ 81).

Output

The milliard VF value in the point  S.

Sample

input	output
1	10

Problem Author: Denis Musin
Problem Source: USU Junior Championship March'2005

Tags:  dynamic programming   ( hide tags for unsolved problems)

Difficulty: 112     Printable version     Submit solution     Discussion (28)
All submissions (10473)     All accepted submissions (5005)     Solutions rating (3944).

代码：

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[100][12];
int s;
/*
    dp[i][j]:表示j位数的和为i的种类数;
    dp[i][j] = sum(dp[i - k][j - 1])(k>=0&&k<=9&&k<=i)
    就是j - 1位数推到j位数，每个和只加一个0-9就能得到i...
*/


void init()
{
    memset(dp, 0, sizeof(dp));
    for(int i = 0; i <= 9; i++) dp[i][1] = 1;
    dp[1][9] = 1;
    for(int j = 2; j <= 9; j++)
        for(int i = 0; i <= s; i++)
            for(int k = 0; k <= 9&&k <= i; k++)
                dp[i][j] += dp[i - k][j - 1];
}

int main()
{
    //freopen("in.txt", "r", stdin);
    while(~scanf("%d", &s))
    {
        init();
        printf("%lld\n", dp[s][9]);
    }
    return 0;
}