OJ Board

Thanks.
But unfortunately,
I cant find how to use DP for this problem.. (Im a beginner :cry: )
Could you explain me how to use it..?

my algorithm is like this:


input:
3 3
0 0

1) First, find all the possible set of stamps. (by recursive function)
1 2 3
1 2 4
1 2 5
1 2 6
1 2 7
1 3 4
...
...
1 ...

I just calculate all the cases (BF..) and got AC,
but i think that is not a good idea
plz give me some hint of more efficient (more fast)
method to solve this problem.