zoukankan      html  css  js  c++  java
  • nyoj 269 VF 动规

    VF

    时间限制:1000 ms  |  内存限制:65535 KB
    难度:2
    描述
    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 Nth 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 = 109) because Vasya himself won’t cope with the task. Can you solve the problem?
    输入
    There are multiple test cases.
    Integer S (1 ≤ S ≤ 81).
    输出
    The milliard VF value in the point S.
    样例输入
    1
    样例输出
    10
    #include<stdio.h>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    
    int n;
    int dp[81][81];
    
    int main()
    {
        int i,j,k,c;
        for(i=1; i<=9; i++)
            dp[1][i]=1;
        for(i=1; i<=9; i++)
        {
            c=9*i;
            for(j=1; j<=c; j++)
            {
                for(k=0; k<=9&&k<=j; k++)
                {
                    dp[i][j]+=dp[i-1][j-k];
                }
            }
        }
        while(~scanf("%d",&n))
        {
            int sum=0;
            if(n==1)
            {
                printf("10
    ");
                continue;
            }
            for(i=1; i<=9; i++)
                sum+=dp[i][n];
            printf("%d
    ",sum);
        }
        return 0;
    }

  • 相关阅读:
    unicode下各种类型转换CString、string
    单元测试简介
    linux系统目录详解
    Python 几个重要的内置函数
    python join split
    将博客搬至CSDN
    COCOS2DX3.0的3种触摸响应机制
    [转] 千万别在最能吃苦的年纪选择安逸
    明白什么是“五险一金”
    MAC 安装更新 ANT
  • 原文地址:https://www.cnblogs.com/nyist-xsk/p/7264893.html
Copyright © 2011-2022 走看看