BZOJ 1655 [Usaco2006 Jan] Dollar Dayz 奶牛商店 01背包+高精度
来源:互联网 发布:淘宝新店写给顾客的话 编辑:程序博客网 时间:2024/06/04 23:21
Description
Farmer John goes to Dollar Days at The Cow Store and discovers an unlimited number of tools on sale. During his first visit, the tools are selling variously for $1, $2, and $3. Farmer John has exactly $5 to spend. He can buy 5 tools at $1 each or 1 tool at $3 and an additional 1 tool at $2. Of course, there are other combinations for a total of 5 different ways FJ can spend all his money on tools. Here they are: 1 @ US$3 + 1 @ US$2 1 @ US$3 + 2 @ US$1 1 @ US$2 + 3 @ US$1 2 @ US$2 + 1 @ US$1 5 @ US$1 Write a program than will compute the number of ways FJ can spend N dollars (1 <= N <= 1000) at The Cow Store for tools on sale with a cost of $1..$K (1 <= K <= 100).
Input
A single line with two space-separated integers: N and K.
Output
A single line with a single integer that is the number of unique ways FJ can spend his money.
Sample Input
Sample Output
HINT
#include<bits/stdc++.h>using namespace std;int f[1005][50];void Plus(int x,int y){int len=max(f[x][0],f[y][0]);for (int i=1;i<=len;i++) f[x][i]=f[x][i]+f[y][i];int i=1;while (i<=len){f[x][i+1]+=f[x][i]/10;f[x][i]%=10;if (f[x][len+1]) len++;i++;}f[x][0]=len;}int main(){int n,K;cin>>n>>K;f[0][0]=f[0][1]=1;for (int i=1;i<=K;i++)for (int j=i;j<=n;j++) Plus(j,j-i);for (int i=f[n][0];i;i--) printf("%d",f[n][i]);putchar('\n');return 0;}
- BZOJ 1655 [Usaco2006 Jan] Dollar Dayz 奶牛商店 01背包+高精度
- 1655: [Usaco2006 Jan] Dollar Dayz 奶牛商店 (完全背包+高精度)
- BZOJ 1655: [Usaco2006 Jan] Dollar Dayz 奶牛商店 dp+高精度
- BZOJ 1655 [Usaco2006 Jan] Dollar Dayz 奶牛商店 完全背包
- |BZOJ 1655|无限背包|高精度|[Usaco2006 Jan] Dollar Dayz 奶牛商店
- bzoj 1655: [Usaco2006 Jan] Dollar Dayz 奶牛商店(高精度完全背包)
- 1655: [Usaco2006 Jan] Dollar Dayz 奶牛商店
- bzoj1655 [Usaco2006 Jan] Dollar Dayz 奶牛商店
- [Usaco2006 Jan] Dollar Dayz 奶牛商店
- bzoj1655 [Usaco2006 Jan] Dollar Dayz 奶牛商店(完全背包+高精)
- POJ--3181--Dollar Dayz--背包/高精度
- poj 3181 Dollar Dayz 高精度+完全背包
- POJ 3181 Dollar Dayz(高精度完全背包)
- POJ3181-Dollar Dayz-完全背包+高精度
- POJ 3181 Dollar Dayz 完全背包 + 高精度
- poj 3181 Dollar Dayz (完全背包+高精度)
- POJ 3181 - Dollar Dayz(完全背包+高精度)
- POJ 3181 Dollar Dayz(完全背包+简单高精度加法)
- canvas移动端画板
- 文件在线预览和下载的实现
- Softmax函数
- Android之使用GPS和NetWork定位
- 获取手机型号
- BZOJ 1655 [Usaco2006 Jan] Dollar Dayz 奶牛商店 01背包+高精度
- vue中命名视图
- spring核心
- Java中集合 练习 计算疯狂值
- HDU 1512 Monkey King(左偏树)
- 训练3+ H-Palindrome Number
- TI am335x 内核分析----以太网移植
- 新闻
- 简单的版本更新