zoukankan      html  css  js  c++  java
  • Expanding Rods

    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. That means you have to calculate h as in the picture.

    Input

    Input starts with an integer T (≤ 20), denoting the number of test cases.

    Each case contains three non-negative real numbers: the initial length of the rod in millimeters L, the temperature change in degrees n and the coefficient of heat expansion of the material C. Input data guarantee that no rod expands by more than one half of its original length. All the numbers will be between 0 and 1000 and there can be at most 5 digits after the decimal point.

    Output

    For each case, print the case number and the displacement of the center of the rod in single line. Errors less than 10-6 will be ignored.

    Sample Input

    3

    1000 100 0.0001

    150 10 0.00006

    10 0 0.001

    Sample Output

    Case 1: 61.3289915

    Case 2: 2.2502024857

    Case 3: 0

    给出弧长    用圆弧对应的角度二分

    #include <iostream>
    #include <cstdio>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <list>
    #include <map>
    #include <stack>
    #include <vector>
    #include <cmath>
    #include <queue>
    #define eps  1e-8
    #define PI acos(-1.0)
    using namespace std;
    int main()
    {    
          int cut=0;
    	int t;
    	scanf("%d",&t);
    	while(t--)
    	{
    		cut++;
    		double L,n,c;
    		scanf("%lf%lf%lf",&L,&n,&c);
    		double L1=(1.0+n*c)*L;
    		double l=0.0,r=PI;
    		int S=100;
    		double h=0;
    		double R=0;
    		while(S--)
    	    {
    	    	double mid=(l+r)/2.0;
    	       R=(L/2.0)/sin(mid/2.0);
    			 if(R*mid<L1)
    			 {
    			 	l=mid;
    			 }
    			 else
    			 {
    			 	r=mid;
    			 }
    		}  
                 	h=R-R*cos(l/2.0);
    		printf("Case %d: %.6lf
    ",cut,h);
    		
    	}
    	return 0;
    }


  • 相关阅读:
    将kali linux装入U盘 制作随身携带的kali linux
    arch/manjaro linux configuration
    python资源

    JSP通过AJAX获取服务端的时间,在页面上自动更新
    Spark基础
    MapReduce基础
    HDFS基础
    C#输出杨辉三角形
    Java窗体居中显示的2种方法
  • 原文地址:https://www.cnblogs.com/kingjordan/p/12027124.html
Copyright © 2011-2022 走看看