• <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

            導航

            統(tǒng)計

            常用鏈接

            留言簿

            文章檔案(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
            • 評論內容較長,點擊標題查看
            • --王私江
            亚洲αv久久久噜噜噜噜噜| 久久国产精品久久久| 亚洲精品国产字幕久久不卡| 亚洲女久久久噜噜噜熟女| 精品综合久久久久久97超人| 久久99精品久久久久久久久久| 91麻豆精品国产91久久久久久| 久久午夜免费视频| 久久精品国产精品青草| 偷窥少妇久久久久久久久| 国产精品免费久久| 久久综合给合久久国产免费| 久久最新免费视频| …久久精品99久久香蕉国产| 久久无码专区国产精品发布| 久久99精品国产99久久6| 欧美噜噜久久久XXX| 狠狠色丁香久久婷婷综合蜜芽五月| 国产一区二区三区久久| 天天爽天天狠久久久综合麻豆| 香蕉久久永久视频| 久久久久久一区国产精品| 精品久久久久久| 久久亚洲春色中文字幕久久久| 国产精品乱码久久久久久软件 | 国产精品欧美久久久久无广告 | 亚洲国产精品热久久| 久久精品99久久香蕉国产色戒| 日韩亚洲国产综合久久久| 久久99精品免费一区二区| 国产亚洲美女精品久久久| 国产69精品久久久久99尤物| 久久最近最新中文字幕大全| 久久久无码一区二区三区| 一本一本久久a久久综合精品蜜桃 一本一道久久综合狠狠老 | 久久综合噜噜激激的五月天| 亚洲午夜久久久久久久久久| 久久人人爽人人爽人人片AV不| 国产精品乱码久久久久久软件| 97久久国产露脸精品国产| 亚洲人成伊人成综合网久久久|