## N-K Special

View as PDF

Points: 10 (partial)
Time limit: 1.0s
Memory limit: 16M

Problem type
Allowed languages
Assembly, Brain****, C, C++, COBOL, Forth, Fortran, Java, Lua, Prolog, Text, Turing

We define " special" set of positive integer numbers as follows:

• each element that belongs to set must meet the restriction .
• the sum of elements of the set must be larger than .
• no pair of elements belonging to the set can be consecutive numbers.

Write a program that reads and as its input and outputs the total number of " special" sets.

#### Sample Input

5 6

#### Sample Output

3

#### Explanation

Sets:

meet the given criteria. No other sets exist.