• UVA 10943 How do you add? DP


    Larry is very bad at math — he usually uses a calculator, which
    worked well throughout college. Unforunately, he is now struck in
    a deserted island with his good buddy Ryan after a snowboarding
    accident.
    They’re now trying to spend some time figuring out some good
    problems, and Ryan will eat Larry if he cannot answer, so his fate
    is up to you!
    It’s a very simple problem — given a number N, how many ways
    can K numbers less than N add up to N?
    For example, for N = 20 and K = 2, there are 21 ways:
    0+20
    1+19
    2+18
    3+17
    4+16
    5+15
    ...
    18+2
    19+1
    20+0
    Input
    Each line will contain a pair of numbers N and K. N and K will both be an integer from 1 to 100,
    inclusive. The input will terminate on 2 0’s.
    Output
    Since Larry is only interested in the last few digits of the answer, for each pair of numbers N and K,
    print a single number mod 1,000,000 on a single line.
    Sample Input
    20 2
    20 2
    0 0
    Sample Output
    21
    21

    题意:  给你N,k  计算k个数相加等于N的方案数,    1,100  输出100

    题解:设定dp[n][k]   dp[i][j] = ∑ dp[k][j - 1](0 ≤ k ≤ i)。

    //meek///#include<bits/stdc++.h>
    #include <iostream>
    #include <cstdio>
    #include <cmath>
    #include <string>
    #include <cstring>
    #include <algorithm>
    #include <queue>
    #include <map>
    #include <set>
    #include <stack>
    #include <sstream>
    #include <vector>
    using namespace std ;
    #define mem(a) memset(a,0,sizeof(a))
    #define pb push_back
    #define fi first
    #define se second
    #define MP make_pair
    typedef long long ll;
    
    const int N = 110;
    const int inf = 99999999;
    const int mod= 1000000007;
    
    int dp[N][N]; //n//k
    int n,k;
    int main() {
        for(int i=0;i<=100;i++) dp[0][i] += 1;
        //for(int i=0;i<=100;i++) dp[i][1] += 1;
        for(int i=1;i<=100;i++) {
            for(int j=1;j<=100;j++) {
                for(int h=0;h<=i;h++)
                  dp[i][j] += dp[h][j-1],dp[i][j] %=  1000000;
            }
        }
        while(~scanf("%d%d",&n,&k)) {
            if(n==0&&k==0) break;
            printf("%d
    ",dp[n][k]);
        }
        return 0;
    }
    daima
  • 相关阅读:
    创建数据库指定编码格式
    java开发环境配置
    Eclipse 配置工程
    声明式事务管理 的5 种方式
    web容器启动顺序
    2.1 实践篇:使用ping来检测网速
    1.1 mysql安装
    1.2 测试人员与开发人员比例
    1.0 软件测试能力
    1.4 测试各阶段(单元、集成、系统 、Alpha、Beta、验收)
  • 原文地址:https://www.cnblogs.com/zxhl/p/5073888.html
Copyright © 2020-2023  润新知