zoj 2734 Exchange Cards
来源:互联网 发布:软件系统安全架构 编辑:程序博客网 时间:2024/06/05 08:14
As a basketball fan, Mike is also fond of collecting basketball player cards. But as a student, he can not always get the money to buy new cards, so sometimes he will exchange with his friends for cards he likes. Of course, different cards have different value, and Mike must use cards he owns to get the new one. For example, to get a card of value 10$, he can use two 5$ cards or three 3$ cards plus one 1$ card, depending on the kinds of cards he have and the number of each kind of card. And Sometimes he will involve unfortunately in a bad condition that he has not got the exact value of the card he is looking for (fans always exchange cards for equivalent value).
Here comes the problem, given the card value he plans to get and the cards he has, Mike wants to fix how many ways he can get it. So it's you task to write a program to figure it out.
Input
The problem consists of multiple test cases, terminated by EOF. There's a blank line between two inputs.
The first line of each test case gives n, the value of the card Mike plans to get andm, the number of different kinds of cards Mike has. n will be an integer number between 1 and 1000.m will be an integer number between 1 and 10.
The next m lines give the information of different kinds of cards Mike have. Each line contains two integers,val and num, representing the value of this kind of card, and the number of this kind of card Mike have.
Note: different kinds of cards will have different value, eachval and num will be an integer greater than zero.
Output
For each test case, output in one line the number of different ways Mike could exchange for the card he wants. You can be sure that the output will fall into an integer value.
Output a blank line between two test cases.
Sample Input
5 22 13 110 510 27 25 32 21 5
Sample Output
17
思路:给定要兑换的总价值和卡片的种类,然后给出每种卡片的价值和数量,求有多少种兑换成总价值的方式
代码:
#include<stdio.h>int v,n,ans,sum;int v1[1100],n1[20];void dfs(int x){if(sum==v){ans++;return ;}if(sum>v||x>n)return ;dfs(x+1);for(int i=1;i<=n1[x];i++){sum+=v1[x];dfs(x+1);}for(int i=1;i<=n1[x];i++)sum-=v1[x];}int main(){int s=0;int i;while(scanf("%d%d",&v,&n)!=EOF){for(i=1;i<=n;i++){scanf("%d%d",&v1[i],&n1[i]);}sum=0;ans=0;dfs(1);printf(s!=0?"\n%d\n":"%d\n",ans);s++;}return 0;}
- ZOJ 2734 Exchange Cards
- zoj - 2734 - Exchange Cards
- zoj 2734 Exchange Cards
- zoj 2734 Exchange Cards
- zoj 2734 Exchange Cards
- zoj 2734 Exchange Cards
- zoj Exchange Cards 2734
- ZOJ 2734(Exchange Cards)
- zoj 2734 Exchange Cards(DFS~)
- ZOJ 2734 Exchange Cards(DFS)
- ZOJ 2734--Exchange Cards【DFS经典】
- ZOJ Exchange Cards 2734【母函数】
- zoj Exchange Cards
- zoj 2734 Exchange Cards 【DFS or 母函数】
- zoj 2734 Exchange Cards(母函数 && DFS)
- ZOJ-2734-Exchange Cards(DFS全排列+去重)
- 【练习赛2补题】zoj 2734 Exchange Cards 【DFS】
- ZOJ 题目2734 Exchange Cards(DFS 去重OR 母函数)
- 内存管理:使用链式栈实现内存的有效管理与监控
- TabError: Inconsistent use of tabs and spaces in indentation
- iOS:hidesBottomBarWhenPushed的正确用法
- iOS之UIImage的三中读取方法
- 【JAVA基础】JAVA中分包的规范
- zoj 2734 Exchange Cards
- nyoj35表达式求值
- IOS学习之解析数据(NSJSONSerialization)
- iOS开发-Day18-OC NSArray&NSMutableArray
- ubuntu下Mycli的安装
- subscription-manager
- 常见笔试面试
- JavaScript基础----01Javascript基础-介绍、实现、输出
- poj1426(深搜)