二分贪心 G
来源:互联网 发布:华为端口聚合配置 编辑:程序博客网 时间:2024/06/06 08:28
Description
When a thin rod of length L is heated n degrees, it expands to a new length L'=(1+n*C)*L, where C is the coefficient of heat expansion.
When a thin rod is mounted on two solid walls and then heated, it expands and takes the shape of a circular segment, the original rod being the chord of the segment.
Your task is to compute the distance by which the center of the rod is displaced.
When a thin rod is mounted on two solid walls and then heated, it expands and takes the shape of a circular segment, the original rod being the chord of the segment.
Your task is to compute the distance by which the center of the rod is displaced.
Input
The input contains multiple lines. Each line of input contains three non-negative numbers: the initial lenth of the rod in millimeters, the temperature change in degrees and the coefficient of heat expansion of the material. Input data guarantee that no rod expands by more than one half of its original length. The last line of input contains three negative numbers and it should not be processed.
Output
For each line of input, output one line with the displacement of the center of the rod in millimeters with 3 digits of precision.
Sample Input
1000 100 0.000115000 10 0.0000610 0 0.001-1 -1 -1
Sample Output
61.329225.0200.000
这道题的题意相当于一个圆知道一条切割的弦长跟对应的弧长,然后求这条弦到对应弧最高点的距离。
几何关系如下:sin(a)=l/2/r,a=s/2/r.(a为角度,s为弧长)。然后用二分查找进行求值。
源代码如下:
#include<iostream>
#include<stdio.h>
#include<math.h>
using namespace std;
int main()
{
double l,n,c,s,r,low,high,mid;
while(scanf("%lf%lf%lf",&l,&n,&c)&&l!=-1&&n!=-1&&c!=-1)
{
low=0,high=0.5*l;
s=(1+n*c)*l;
while(high-low>1e-5)
{
mid=(low+high)/2;
r=(4*mid*mid+l*l)/(8*mid);
if(2*r*asin(l/(2*r))<s) low=mid;
else high=mid;
}
printf("%.3f\n",mid);
}
return 0;
}
需要注意的是输入输出要用scanf跟pritnf。循环条件到1e-5即可,再小的话可能就超时了。
0 0
- 二分贪心 G
- 二分贪心 G 受热膨胀
- 二分贪心练习--G(烧绳子问题)
- 二分+贪心
- 贪心 + 二分
- 贪心二分
- 贪心+二分
- 贪心(bnuoj49103+二分+贪心)
- BNU 49103 贪心【二分+贪心】
- hdu pie(二分+贪心)
- POJ3497 Assemble 二分+贪心
- mysterious 二分加贪心
- HDU 3650 贪心+二分
- 11627 - Slalom (二分+贪心)
- 二分+贪心+LA3177
- hdu4004(二分+贪心)
- hdu1677(贪心+二分)
- poj2456(贪心+二分)
- 剑指offer-31.整数中1出现的次数(从1到n整数中1出现的次数)
- PHP接口类interface使用方法
- hdu 5978 · To begin or not to begin【概率题】【手速题】
- 单源最短路径
- Map集合及HashMap源码分析
- 二分贪心 G
- Codeforces Round #408(Div.2)
- C笔记
- pzhu 1080: 修电脑 (Dijkstra 算法)
- Simpsons' Hidden Talents hdu2594 kmp
- [LeetCode]566. Reshape the Matrix
- Node.js建站之安装express(一)
- Linux 64位安装32位运行库(解决RK3399 make kernel.img error)
- e1000收包的调试