A10018 | A Problem about Polyline
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
There is a polyline going through points $(0,0)–(x,x)–(2x,0)–(3x,x)–(4x,0)–...-(2kx,0)–(2kx+x,x)–...$ .
We know that the polyline passes through the point $(a,b)$ . Find minimum positive value $x$ such that it is true or determine that there is no such $x$ .
We know that the polyline passes through the point $(a,b)$ . Find minimum positive value $x$ such that it is true or determine that there is no such $x$ .
输入格式
Only one line containing two positive integers $a$ and $b$ ( $1<=a,b<=10^{9}$ ).
输出格式
Output the only line containing the answer. Your answer will be considered correct if its relative or absolute error doesn't exceed $10^{-9}$ . If there is no such $x$ then output $-1$ as the answer.
输入输出样例
输入 #1
3 1
输出 #1
1.000000000000
输入 #2
1 3
输出 #2
-1
输入 #3
4 1
输出 #3
1.250000000000
You can see following graphs for sample 1 and sample 3.
 
 
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted