A15557 | The Ultimate Square
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You have $n$ rectangular wooden blocks, which are numbered from $1$ to $n$ . The $i$ -th block is $1$ unit high and $\lceil \frac{i}{2} \rceil$ units long.
Here, $\lceil \frac{x}{2} \rceil$ denotes the result of division of $x$ by $2$ , rounded up. For example, $\lceil \frac{4}{2} \rceil = 2$ and $\lceil \frac{5}{2} \rceil = \lceil 2.5 \rceil = 3$ .
For example, if $n=5$ , then the blocks have the following sizes: $1 \times 1$ , $1 \times 1$ , $1 \times 2$ , $1 \times 2$ , $1 \times 3$ .
 The available blocks for $n=5$ Find the maximum possible side length of a square you can create using these blocks, without rotating any of them. Note that you don't have to use all of the blocks.
 One of the ways to create $3 \times 3$ square using blocks $1$ through $5$
Here, $\lceil \frac{x}{2} \rceil$ denotes the result of division of $x$ by $2$ , rounded up. For example, $\lceil \frac{4}{2} \rceil = 2$ and $\lceil \frac{5}{2} \rceil = \lceil 2.5 \rceil = 3$ .
For example, if $n=5$ , then the blocks have the following sizes: $1 \times 1$ , $1 \times 1$ , $1 \times 2$ , $1 \times 2$ , $1 \times 3$ .
 The available blocks for $n=5$ Find the maximum possible side length of a square you can create using these blocks, without rotating any of them. Note that you don't have to use all of the blocks.
 One of the ways to create $3 \times 3$ square using blocks $1$ through $5$
输入格式
Each test contains multiple test cases. The first line contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases.
The first line of each test case contains a single integer $n$ ( $1 \le n \le 10^9$ ) — the number of blocks.
The first line of each test case contains a single integer $n$ ( $1 \le n \le 10^9$ ) — the number of blocks.
输出格式
For each test case, print one integer — the maximum possible side length of a square you can create.
输入输出样例
输入 #1
3 2 5 197654321
输出 #1
1 3 98827161
In the first test case, you can create a $1 \times 1$ square using only one of the blocks.
In the second test case, one of the possible ways to create a $3 \times 3$ square is shown in the statement. It is impossible to create a $4 \times 4$ or larger square, so the answer is $3$ .
In the second test case, one of the possible ways to create a $3 \times 3$ square is shown in the statement. It is impossible to create a $4 \times 4$ or larger square, so the answer is $3$ .
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted