• <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 閱讀(203) 評論(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
            • 評論內容較長,點擊標題查看
            • --王私江
            国产69精品久久久久99| 久久亚洲欧洲国产综合| 伊人久久大香线蕉成人| 久久久久久曰本AV免费免费| 久久AV高潮AV无码AV| 久久精品国产亚洲AV无码娇色| 99国产精品久久| 久久综合伊人77777| 久久婷婷国产综合精品| 一本色道久久88加勒比—综合| 久久夜色撩人精品国产小说| 亚洲中文字幕久久精品无码喷水| 久久综合中文字幕| 色婷婷综合久久久久中文| 狠狠综合久久综合中文88| 欧美va久久久噜噜噜久久| 久久青青草原综合伊人| 亚洲伊人久久大香线蕉综合图片 | 91久久精品国产91性色也| 中文字幕精品久久| 国产999精品久久久久久| 久久棈精品久久久久久噜噜| 亚洲国产成人久久一区久久| 26uuu久久五月天| 日韩人妻无码精品久久久不卡| 国内精品久久久久久久coent| 久久国产精品99国产精| 久久99国产精品久久99小说| 久久亚洲电影| 国产成人精品久久一区二区三区av| 影音先锋女人AV鲁色资源网久久| 久久亚洲国产成人影院网站| 99久久精品九九亚洲精品| 精品久久久噜噜噜久久久| 欧美牲交A欧牲交aⅴ久久| 麻豆一区二区99久久久久| 亚洲va久久久噜噜噜久久男同| 亚洲日本va午夜中文字幕久久 | 久久亚洲国产最新网站| 国产精品亚洲综合久久| 久久久国产打桩机|