Codeforces Round #320 (Div. 1) A. A Problem about Polyline
来源:互联网 发布:ff14猫男捏脸数据分享 编辑:程序博客网 时间:2024/04/19 14:04
首先明确一点的是,所给的点
那么我们怎么确定是在哪一条折线呢?看下图:
每条斜率为-1的折线都可以被分成虚线间的几部分。这是使得
也就是说,是那一条折线就是
其中D为截距。
求得
#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>#include<iostream>#include<algorithm>using namespace std;int main(){ int a,b; scanf("%d%d",&a,&b); if(b>a)printf("-1\n"); else { int k=(a/b); if(k&1)k++; printf("%.12f\n",(a+b)*1.0/k); } return 0;}
0 0
- Codeforces Round #320 (Div. 1) A. A Problem about Polyline
- Codeforces Round #320 (Div. 2)C. A Problem about Polyline
- Codeforces Round #320 (Div. 2) C. A Problem about Polyline
- Codeforces Round #320 (Div. 2) C - A Problem about Polyline
- Codeforces Round #320 (Div. 2) C - A Problem about Polyline
- Codeforces Round #320 (Div. 2) C. A Problem about Polyline
- Codeforces Round #320 (Div. 2) 578A. A Problem about Polyline
- Codeforces Round #320 (Div. 2) [Bayan Thanks-Round] C. A Problem about Polyline 精度控制
- Codeforces Round #320 (Div. 2) [Bayan Thanks-Round] C. A Problem about Polyline
- Codeforces 579 C. A Problem about Polyline(Codeforces Round #320 (Div. 2) )
- Codeforces Round #320 (Div. 2) 579C A Problem about Polyline(数学)
- cf#320 Div.2 Problem C A Problem about Polyline
- cf#320 Div.2 Problem C A Problem about Polyline
- A Problem about Polyline
- codeforces 320c A Problem about Polyline(数学)
- cf 320# A Problem about Polyline (二分)
- [CodeForces 579C]A Problem about Polyline[数学]
- CodeForces 579C A Problem about Polyline[数学]
- Bug:编译链接,发现找不到符号,用nm工具查看,发现符号属性有两个分别是U和T
- 数据库Sharding的基本思想和切分策略
- Ubuntu 15.04配置静态IP和DNS
- 什么是 REF游标
- 常用jar包之commons-digester使用
- Codeforces Round #320 (Div. 1) A. A Problem about Polyline
- [python] 0x7 Python Tutorial: Web Scanning and Exploitation
- .net版本发展历史
- mysql workbench cannot be executed from a path that contains non-ascii charater.
- 第8章 通用程序设计
- Eclipse中的.project 和 .classpath文件的具体作用及maven工程classpath说明
- jmeter(一)
- achartengine绘制折线图
- js实现每日签到功能