• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            poj1905

            Expanding Rods
            Time Limit: 1000MS Memory Limit: 30000K
            Total Submissions: 8376 Accepted: 2058

            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
                        

            Source

            推一下公式

            然后二分就可以了

            可以二分的有很多

            但是如果二分圓心角的話感覺特別簡單


            code

            #include <cstdio>
            #include 
            <cstdlib>
            #include 
            <cstring>
            #include 
            <cmath>
            #include 
            <ctime>
            #include 
            <cassert>
            #include 
            <iostream>
            #include 
            <sstream>
            #include 
            <fstream>
            #include 
            <map>
            #include 
            <set>
            #include 
            <vector>
            #include 
            <queue>
            #include 
            <algorithm>
            #include 
            <iomanip>
            using namespace std;
            double l,ll,n,c;
            int main()
            {
                
            double left,mid,right;
                
            while(scanf("%lf%lf%lf",&l,&n,&c)!=EOF)
                {
                    
            if(l==-1&&n==-1&&c==-1break;
                    
            if(l==0||n==0||c==0)
                    {
                        printf(
            "0.000\n");
                        
            continue;
                    }
                    ll
            =l*(1+n*c);
                    left
            =0;
                    right
            =acos(-1.0);
                    
            //二分角度
                    while(right-left>1e-12)
                    {
                        mid
            =(left+right)/2;
                        
            if(mid*l>2*ll*sin(mid/2))
                            right
            =mid;
                        
            else left=mid;
                    }
                    printf(
            "%.3lf\n",(1-cos(mid/2))*l/(2*sin(mid/2)));
                }
                
            return 0;
            }

            posted on 2012-08-02 17:02 jh818012 閱讀(204) 評論(0)  編輯 收藏 引用

            <2025年7月>
            293012345
            6789101112
            13141516171819
            20212223242526
            272829303112
            3456789

            導航

            統計

            常用鏈接

            留言簿

            文章檔案(85)

            搜索

            最新評論

            • 1.?re: poj1426
            • 我嚓,,輝哥,,居然搜到你的題解了
            • --season
            • 2.?re: poj3083
            • @王私江
              (8+i)&3 相當于是 取余3的意思 因為 3 的 二進制是 000011 和(8+i)
            • --游客
            • 3.?re: poj3414[未登錄]
            • @王私江
              0ms
            • --jh818012
            • 4.?re: poj3414
            • 200+行,跑了多少ms呢?我的130+行哦,你菜啦,哈哈。
            • --王私江
            • 5.?re: poj1426
            • 評論內容較長,點擊標題查看
            • --王私江
            久久亚洲av无码精品浪潮| 伊人色综合久久天天网| 欧美噜噜久久久XXX| 欧美熟妇另类久久久久久不卡| 精品免费久久久久久久| 国产精品99久久精品爆乳| 久久综合久久综合亚洲| AV无码久久久久不卡网站下载| 国产精品免费久久久久影院 | 青青青国产成人久久111网站| 久久久WWW免费人成精品| 思思久久好好热精品国产| 久久久久久人妻无码| 久久国产一片免费观看| 久久久久亚洲AV无码专区体验| 精品久久久久中文字| 久久久久久久97| 亚洲乱码日产精品a级毛片久久| 91精品国产9l久久久久| 亚洲午夜无码AV毛片久久| 热久久这里只有精品| 伊人久久综合无码成人网| 久久久久久久亚洲精品| 精品久久久久久国产91| 老色鬼久久亚洲AV综合| 久久99国产精品久久99小说| 大蕉久久伊人中文字幕| 久久精品国产精品亚洲精品| 久久久精品人妻一区二区三区蜜桃 | 尹人香蕉久久99天天拍| 久久久青草青青国产亚洲免观| 国产精品久久久久aaaa| 久久99热只有频精品8| 亚洲va国产va天堂va久久| 久久人人青草97香蕉| 人妻中文久久久久| 亚洲欧美另类日本久久国产真实乱对白 | 国内精品久久久久影院网站 | 久久国产精品波多野结衣AV| 久久99国产精品二区不卡| 久久精品草草草|