Time

13:25:08
23 May 2012
Version for print

Ladders

   Ladder is a set of cubes in which each over the top layer contains fewer blocks than the previous one.

prb989

   Count the number of ladders that can be built from the N blocks.


Specifications

   Input

   In the input file contains integer N (1N100).

   Output

   The output file to derive the required number of ladders.


Problem information

Time Limit: 1 seconds
Memory Limit: 64 MB
Balls for the passed test: 11.1111
Complexity: 26% 93/126
Classes: Dynamic programming

Example

Example input

3

Example output

2


← Subsequence Problems Recovering parentheses →