|
Time limit 1000/1000/1000/1000 ms. Memory limit 65000/65000/65000/65000 Kb.
Problem description There is a corridor N meters length and M meters wide. John decided to cover its floor with N blocks sized 1xM meters and he wonders how many different ways are there to do it? For example, if N=6 and M=4 then there are 4 ways to do it (see the picture).Input There are 2 integers M and N in input file (2 ≤ M ≤ N ≤ 50). Output One integer – answer to the question. Example
|