HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Arithmetic > problem:


50249 - Ladders

Guest
• Discussion of problem (1)

Section problems

• 50572 - Palindromic Numbers
• 50582 - Number of digits
• 50583 - Max of 3 numbers
• 50585 - Inner Product
• 50587 - Modular Conversion
• 50633 - The prime factors
• 50650 - Prime numbers
• 50661 - nth Power of a Digit
• 50249 - Ladders
• 50641 - Strong Prime Power
• 50640 - Cubes
• 50412 - K numbers
• 50310 - Kinetic Energy
• 50316 - Population Bar Chart
• 50314 - Falling Distance
• 50392 - How much space
• 50330 - Find the average of n numbers

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb. Difficulty Beta

Ladder is a set of cubes in one or more layers in which each over the top layer contains fewer blocks than the bottom.

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

Enter
At the entrance recorded the number N (1 ≤ N ≤ 100).
Output
Print the required number of ladders.

Input
3
Output
2

Для отправки решений необходимо выполнить вход.

www.contester.ru