A15154 | AvtoBus
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Spring has come, and the management of the AvtoBus bus fleet has given the order to replace winter tires with summer tires on all buses.
You own a small bus service business and you have just received an order to replace $n$ tires. You know that the bus fleet owns two types of buses: with two axles (these buses have $4$ wheels) and with three axles (these buses have $6$ wheels).
You don't know how many buses of which type the AvtoBus bus fleet owns, so you wonder how many buses the fleet might have. You have to determine the minimum and the maximum number of buses that can be in the fleet if you know that the total number of wheels for all buses is $n$ .
You own a small bus service business and you have just received an order to replace $n$ tires. You know that the bus fleet owns two types of buses: with two axles (these buses have $4$ wheels) and with three axles (these buses have $6$ wheels).
You don't know how many buses of which type the AvtoBus bus fleet owns, so you wonder how many buses the fleet might have. You have to determine the minimum and the maximum number of buses that can be in the fleet if you know that the total number of wheels for all buses is $n$ .
输入格式
The first line contains an integer $t$ ( $1 \le t \le 1\,000$ ) — the number of test cases. The following lines contain description of test cases.
The only line of each test case contains one integer $n$ ( $1 \le n \le 10^{18}$ ) — the total number of wheels for all buses.
The only line of each test case contains one integer $n$ ( $1 \le n \le 10^{18}$ ) — the total number of wheels for all buses.
输出格式
For each test case print the answer in a single line using the following format.
Print two integers $x$ and $y$ ( $1 \le x \le y$ ) — the minimum and the maximum possible number of buses that can be in the bus fleet.
If there is no suitable number of buses for the given $n$ , print the number $-1$ as the answer.
Print two integers $x$ and $y$ ( $1 \le x \le y$ ) — the minimum and the maximum possible number of buses that can be in the bus fleet.
If there is no suitable number of buses for the given $n$ , print the number $-1$ as the answer.
输入输出样例
输入 #1
4 4 7 24 998244353998244352
输出 #1
1 1 -1 4 6 166374058999707392 249561088499561088
In the first test case the total number of wheels is $4$ . It means that there is the only one bus with two axles in the bus fleet.
In the second test case it's easy to show that there is no suitable number of buses with $7$ wheels in total.
In the third test case the total number of wheels is $24$ . The following options are possible:
- Four buses with three axles.
- Three buses with two axles and two buses with three axles.
- Six buses with two axles.
So the minimum number of buses is $4$ and the maximum number of buses is $6$ .
In the second test case it's easy to show that there is no suitable number of buses with $7$ wheels in total.
In the third test case the total number of wheels is $24$ . The following options are possible:
- Four buses with three axles.
- Three buses with two axles and two buses with three axles.
- Six buses with two axles.
So the minimum number of buses is $4$ and the maximum number of buses is $6$ .
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted