Hide
Problem A
Cracker Baking
Image by Susan Gaber OpenClipArt.org,
Public domain
We are going to bake a number of tiny and square snack crackers ($1$ cm on a side) in a square baking pan. Crackers may not overlap while baking, and must entirely fit within the baking pan.
Print the length (which is the same as the width), in centimetres, of the smallest baking pan that could be used. Baking pans have to be a whole number of centimetres in length and width.
Input
The input is a positive integer $N$, the number of crackers. We have that $N \leq 1\, 000$.
Output
Produce a positive integer, giving the length and width of the smallest possible baking pan.
| Sample Input 1 | Sample Output 1 |
|---|---|
8 |
3 |
| Sample Input 2 | Sample Output 2 |
|---|---|
10 |
4 |
