• <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
            • 評論內容較長,點擊標題查看
            • --王私江
            91久久九九无码成人网站| 久久亚洲欧美日本精品| 久久久久av无码免费网| 2021少妇久久久久久久久久| 久久午夜综合久久| 久久无码人妻一区二区三区午夜| 国产精品gz久久久| 大伊人青草狠狠久久| 亚洲午夜无码AV毛片久久| 99久久婷婷国产综合精品草原| 色综合合久久天天给综看| 久久综合九色综合欧美就去吻| 亚洲精品乱码久久久久久中文字幕 | 久久久99精品成人片中文字幕| 99久久国语露脸精品国产| 免费一级欧美大片久久网| 久久综合中文字幕| 久久久国产打桩机| 一级a性色生活片久久无少妇一级婬片免费放 | 成人免费网站久久久| 欧美日韩精品久久久久| 久久久久久国产a免费观看黄色大片| 欧美粉嫩小泬久久久久久久| 日本道色综合久久影院| 99久久精品影院老鸭窝| 久久久久久国产精品无码超碰| 99久久久国产精品免费无卡顿| 精品久久一区二区| 国产激情久久久久影院老熟女免费| 久久久久高潮毛片免费全部播放| 久久人人爽人人爽人人片AV高清| 久久91精品国产91久| 伊人色综合久久天天网| 久久91精品国产91久| 久久亚洲精品无码aⅴ大香| 国产69精品久久久久APP下载| 一本大道久久东京热无码AV| 久久久久久久波多野结衣高潮| 免费无码国产欧美久久18| 亚洲精品乱码久久久久久自慰 | 久久精品国产亚洲AV无码娇色 |