ACM-Expanding Rods

本文介绍了一个计算加热后杆形零件变形的程序实现方法。通过二分查找法求解加热后的杆形零件变成圆弧形状时中心位移的问题,并给出了具体的算法实现及样例输入输出。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

A - Expanding Rods
Time Limit:1000MS     Memory Limit:30000KB     64bit IO Format:%I64d & %I64u

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. 

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.0001
15000 10 0.00006
10 0 0.001
-1 -1 -1

Sample Output

61.329
225.020
0.000

 
        
集训的第一个题,我竟然连圆的几个公式都不记得了,好吧~ 
二分,综合两个公式,然后,精度弄高点,不然就wa了
#include <iostream>
#include <cstdio>
#include <cmath>

using namespace std;

int main()
{
    double n,c,l;
    while(~scanf("%lf %lf%lf",&l,&n,&c))
    {

        if(l < 0 && n < 0 && c < 0)
            break;
        double ll = (1 + n * c) * l;
//        printf("%.3lf",l);
        double low, high ,mid , r;
        low  = 0;
        high = l / 2;

        while (high - low > 0.000001)
        {
            mid =(low  + high)/2;
            r  =((l * l)+(4*mid *mid ))/ (8 * mid );
            if ((2 * r * asin(l / (2*r)) < ll))
                low = mid;
            else
                high = mid;

        }
        printf ("%.3lf\n",mid);
    }
    return 0;
}


61.329
225.020
0.000

转载于:https://www.cnblogs.com/wejex/p/3218797.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值