zoj Exchange Cards 2734
来源:互联网 发布:人工智能龙头企业 港股 编辑:程序博客网 时间:2024/05/29 18:06
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 n,m,count;typedef struct {int val;int num;}Card;Card card[15];void dfs(int c,int tol){if(tol>n){return;}if(tol==n) { count++; return;}if(c==m) return;for(int i=0;i<=card[c].num;i++){dfs(c+1,tol+i*card[c].val);}}int main(){int f=0;while(scanf("%d%d",&n,&m)!=EOF){if(f++) printf("\n");int i;count=0;for(i=0;i<m;i++) scanf("%d%d",&card[i].val,&card[i].num); dfs(0,0); printf("%d\n",count);}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 母函数)
- 全志A20平台实现VGA和HDMI双屏同显
- jdk使用问题汇总
- 用JQuery获取File input里面的数据
- Always Full GC before Dump
- Haxe: class, object, new and constructor
- zoj Exchange Cards 2734
- openssl windows 本地配置问题
- 图文讲解如何搭建Apache服务器
- android卸载或者程序更新,SharedPrefefences文件会删除吗
- 31.c/c++程序员面试宝典-函数参数的传递
- 用栈走迷宫
- Python机器学习——如何shuffle一个数据集(ndarray类型)
- 爬梯子转非递归
- iOS 打包上线_报错All object files and libraries for bitcode...