1655: [Usaco2006 Jan] Dollar Dayz 奶牛商店 (完全背包+高精度)

最新推荐文章于 2018-05-09 11:56:00 发布

ndsffx501ccy

最新推荐文章于 2018-05-09 11:56:00 发布

阅读量505

点赞数

分类专栏：动态规划/贪心/递推

本文链接：https://blog.csdn.net/ndsffx501ccy/article/details/37411331

版权

动态规划/贪心/递推专栏收录该内容

85 篇文章 0 订阅

订阅专栏

#include<algorithm>  
#include<iostream>  
#include<cstring>  
#include<cstdio>  
#define inf 0x7fffffff  
#define MAXN 100001
using namespace std;

inline int read() {
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-')f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x*f;
}
int n, k;
long long a[1100], b[1100], temp = 1;

int main() {
    n = read();
    k = read();
    a[0] = 1;
    for (int i = 1; i <= 18; i++)
        temp *= 10;
    for (int i = 1; i <= k; i++)
        for (int j = i; j <= n; j++) {
            b[j] = b[j] + b[j - i]+(a[j] + a[j - i]) / temp;
            a[j] = (a[j] + a[j - i]) % temp;
        }
    if (b[n])printf("%lld", b[n]);
    printf("%lld", a[n]);
    return 0;
}