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>  
     int dp[9][81];//在这里定义  
    int main(){  
        int n,i,j,sum,k;  
        for(i=1;i<=9;i++) dp[1][i]=1;  
        for(i=1;i<=9;i++)  
            for(j=1;j<=i*9;j++)  
                for(k=0;k<=9&&k<=j;k++)  
                    dp[i][j]+=dp[i-1][j-k];  
        while(scanf("%d",&n)!=EOF){  
            if(n==1) {  
                printf("10
    ");  
                continue;  
            }  
            sum=0;  
            for(i=1;i<=9;i++)  
                sum+=dp[i][n];  
            printf("%d
    ",sum);  
        }  
        return 0;  
    }          
    

      

  • 相关阅读:
    0~n-1中缺失的数字
    仅仅反转字母
    字符串相加
    反转字符串&反转字符串中的元音字母
    python OrderedDict类&LRU缓存机制练习题
    协程greenlet、gevent、猴子补丁
    生产者与消费者(两个线程之间的通信---队列实现)
    jquery的on()
    Python之内置类型
    Python之比较运算符
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7053296.html
Copyright © 2011-2022 走看看