zoj 2734

Exchange Cards

Time Limit: 2 Seconds      Memory Limit: 65536 KB

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.


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 and m, 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, each val and num will be an integer greater than zero.


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 2
2 1
3 1

10 5
10 2
7 2
5 3
2 2
1 5

Sample Output



Author: DAI, Wenbin
Source: Zhejiang University Local Contest 2006

这道题有点类似zoj 1204,都是一道用DFS解决的题,这道题比较简单,只需要用最基本的DFS就可以解决

using namespace std;

int card[100];
int n,m;
int sum;
int ways;

void DFS(int x)
	if(sum == n)
	for(int i=x; i<=n; i++)
		if( card[i] && sum + i<=n)
			sum += i;
			sum -= i;

int main()
	int p = 0;
		p = 1;
		memset(card, 0, sizeof(card));
		sum = 0;
		ways = 0;
		int val,num;
			card[val] = num;
	return 0;

个人分类: ACM(vegetable bird)
上一篇zoj 1204
下一篇zoj 2097 Walking on a Chessboard
想对作者说点什么? 我来说一句