영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
Problem
(그림은 원문 저장소에서 볼 수 있습니다)
Figure 1: An example pyramid of height 3 with 35 blocks.
When initiating a larger project, like building a pyramid, it's best to think twice. Your task today is to write a program that computes how high a pyramid can be built given a certain number of blocks of stone.
We assume that the pyramid to be built is compact, i.e. there are no cavities inside. Furthermore, we assume it is built according to the principle in Figure 1. Each layer is square, with a side length that is two blocks less than that of the layer below it. The top layer always consists of a single block.
It is fine if you have leftover blocks, as long as you build a complete pyramid.
Input
The first and only line of input contains an integer N (1 ≤ N ≤ 100000000), the number of blocks you have available.
Output
Print an integer: the maximum height of a pyramid that can be built with at most N blocks.
Scoring
Your solution will be tested on a set of test groups. To earn points for a group, you must pass all test cases in that group.
| Group | Points | Constraints |
|---|---|---|
| 1 | 33 | There will be no leftover blocks after building the pyramid. |
| 2 | 67 | No additional constraints. |
예제
예제 1
83
3