1655: [Usaco2006 Jan] Dollar Dayz 奶牛商店
来源:互联网 发布:itoa函数在linux 编辑:程序博客网 时间:2024/06/08 21:35
1655: [Usaco2006 Jan] Dollar Dayz 奶牛商店
Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 477 Solved: 253
[Submit][Status][Discuss]
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
Source
Silver
#include<iostream>#include<algorithm>#include<cstdio>#include<cmath>#include<climits>#include<cstdlib>#include<cstring>#include<string>#include<fstream>#include<queue>#include<map>#include<set>#include<stack>#define N 1001using namespace std;int n,k;int f[N];struct node{int a[50],len;}p[N];void add(node &a,node &b){node c;int lenc=0;for(int i=0;i<=49;i++)c.a[i]=0;for(int i=1;i<=min(a.len,b.len);i++){c.a[i]+=a.a[i]+b.a[i];if(c.a[i]>9)c.a[i]-=10,c.a[i+1]++;}int j=min(a.len,b.len)+1;lenc=j-1;while(j<=a.len){c.a[j]+=a.a[j];if(c.a[j]>9)c.a[j]-=10,c.a[j+1]++;j++;lenc=a.len;}while(j<=b.len){c.a[j]+=b.a[j];if(c.a[j]>9)c.a[j]-=10,c.a[j+1]++;j++;lenc=b.len;}if(c.a[j])lenc++;c.len=lenc;a=c;}int main(){//freopen("in.txt","r",stdin);//freopen("my.txt","w",stdout);p[0].len=1,p[0].a[1]=1;for(int i=2;i<=49;i++)p[0].a[i]=0;scanf("%d%d",&n,&k);for(int j=1;j<=k;j++)for(int i=n;i>=j;i--)for(int u=1;u*j<=i;u++)add(p[i],p[i-u*j]);for(int i=p[n].len;i;i--)printf("%d",p[n].a[i]);}
- 1655: [Usaco2006 Jan] Dollar Dayz 奶牛商店
- bzoj1655 [Usaco2006 Jan] Dollar Dayz 奶牛商店
- [Usaco2006 Jan] Dollar Dayz 奶牛商店
- 1655: [Usaco2006 Jan] Dollar Dayz 奶牛商店 (完全背包+高精度)
- BZOJ 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 奶牛商店 01背包+高精度
- bzoj1655 [Usaco2006 Jan] Dollar Dayz 奶牛商店(完全背包+高精)
- Dollar Dayz
- BZOJ 1654: [Usaco2006 Jan]The Cow Prom 奶牛舞会
- bzoj1654 [Usaco2006 Jan]The Cow Prom 奶牛舞会
- bzoj1654: [Usaco2006 Jan]The Cow Prom 奶牛舞会
- [BZOJ1654] [Usaco2006 Jan]The Cow Prom 奶牛舞会
- 【BZOJ】1654: [Usaco2006 Jan]The Cow Prom 奶牛舞会
- 1654: [Usaco2006 Jan]The Cow Prom 奶牛舞会
- BZOJ 1635: [Usaco2006 Jan]The Cow Prom 奶牛舞会 tarjan
- Public关键词
- Chrome和HTTPS——安全Web的征途
- 23种设计模式
- Android 开发60条技术经验总结
- cv论文(Low-rank相关)
- 1655: [Usaco2006 Jan] Dollar Dayz 奶牛商店
- A Simple Servlet Container
- 11期 11月期刊自荐
- 使用ThinkPHP框架快速开发网站
- 计算星座
- Uploadify插件的参数属性、事件、方法函数详解
- 2016.11.14 jq(HTML )
- 单例模式的方法不是线程安全的
- 图片上传——html5+PHP实现无刷新上传