VF(동적 계획)

1525 단어 동적 기획
VF
시간 제한:
1000ms | 메모리 제한: 65535KB
난이도:
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 
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?
입력
There are multiple test cases.
Integer S (1 ≤ S ≤ 81).
출력
The milliard VF value in the point S.
샘플 입력
1

샘플 출력
10
: , 1000000000 n , ;
#include<stdio.h>
int main(){
    int vf[10][90]={0},i,j,k,sum,s;
    
    for(int i=1;i<=9;++i)vf[1][i]=1;
    for(int i=1;i<=9;++i)for(int j=1;j<=9*i;++j)for(int k=0;k<=j&&k<=9;++k)vf[i][j]+=vf[i-1][j-k];
    while(~scanf("%d",&s)){sum=0;
    if(s==1)printf("10
");
    else{
        for(int i=1;i<=9;++i)sum+=vf[i][s];
        printf("%d
",sum);}
    }
    return 0;
}

좋은 웹페이지 즐겨찾기