| About Olympic -> Problems -> IV OI 1996/1997 |  |
|
IV Olimpiada Informatyczna 1996/1997
|
|
Task: LIC
|
Author: Wojciech Rytter
|
The number of n-k-special sets
| III stage contest |
| Source file | LIC.??? (e.g. PAS,C, CPP) |
| Executable file | LIC.EXE |
| Input file | LIC.IN |
| Output file | LIC.OUT |
We say that a set X of natural numbers is n-k-special if:
- for every x belonging to the set X: 1 <= x <= n,
- the sum of all integers from X is greater than k,
- X does not contain a pair of consecutive natural numbers.
Task
Write a program that:- reads two natural numbers n and k from the text file LIC.IN,
- computes the number of n-k-special sets,
- writes the result to the text file LIC.OUT.
Input
In the first line of the text file LIC.IN there are two natural numbers n and k separated by a single space, 1 <= n <= 100, 0 <= k <= 400.
Output
In the first line of the text file LIC.OUT there should be written one non-negative integer, which equals the number of n-k-special sets for the given n and k.
Example
For the text file LIC.IN:5 6the correct solution is the text file LIC.OUT
3