欢迎来到起遇信息学
起遇信息学正处于上线筹建阶段,以下功能已全部开放免费体验: ✅ 完整题库浏览与代码提交评测(C / C++ / Python / Java 等) ✅ 入门到进阶的系列课程试读、作业与考试 ✅ AI 提示、AI 作业分析等智能助教功能 ✅ 赛事模拟与个人能力报告 ✅ 邮箱注册开放 ⏳ 付费课程订阅与微信/支付宝支付通道 ⏳ 手机号登录,微信扫码登录、微信公众号绑定 使用中如遇任何问题,欢迎通过页面底部 **"联系我们"** 与我们沟通。
CF1748A.The Ultimate Square
The Ultimate Square
You have rectangular wooden blocks, which are numbered from to . The -th block is unit high and units long.
Here, denotes the result of division of by , rounded up. For example, and .
For example, if , then the blocks have the following sizes: , , , , .
The available blocks for
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 square using blocks through
Input
Each test contains multiple test cases. The first line contains a single integer () — the number of test cases.
The first line of each test case contains a single integer () — the number of blocks.
Output
For each test case, print one integer — the maximum possible side length of a square you can create.
Note
In the first test case, you can create a square using only one of the blocks.
In the second test case, one of the possible ways to create a square is shown in the statement. It is impossible to create a or larger square, so the answer is .
Samples
3
2
5
197654321
1
3
98827161
在线编程 IDE
建议全屏模式获得最佳体验
| 进入全屏编程 | Alt+E |
| 递交评测 | Ctrl+Enter |
| 注释/取消注释 | Ctrl+/ |
| 缩放字体 | Ctrl+滚轮 |