2006 Canadian Computing Competition, Stage 1

Problem J2: Roll the Dice

Diana is playing a game with two dice. One die has m sides labelled 1, 2, 3, ..., m.
The other die has n sides labelled 1, 2, 3, ..., n.

Write a program to determine how many ways can she roll the dice to get the sum 10.

For example, when the first die has 6 sides and the second die has 8 sides, there are 5 ways to get the sum 10:

Input

The input is given as two integers. First, the user will enter in the number m (1 ≤ m ≤ 1000).
Second, the user will enter the number n (1 ≤ n ≤ 1000).

Output

The program prints out the number of ways 10 may be rolled on these two dice. Note that in the output, the word “way” should be used if there is only one way to achieve the sum of 10; otherwise, the word “ways” should be used in the output. That is, if there is only one way to get the sum 10, the output should be:

There is 1 way to get the sum 10.

Sample Input 1

6
8

Sample Output 1

There are 5 ways to get the sum 10.

Sample Input 2

12
4

Sample Output 2

There are 4 ways to get the sum 10.

All Submissions
Best Solutions

Point Value: 3
Time Limit: 2.00s
Memory Limit: 16M
Added: Sep 30, 2008

Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

Comments (Search)

You can have reverse but since there are only 6 sides on the dice, you can't have 7,3.

if there is any thing wrong in input 4, remember, you have to watch out for if there is no way to get the sum 10

In the example, isn't 4+6 = 10 equivalent to 6+4 = 10?
So there should only be 4 ways.