• <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>
            隨筆 - 87  文章 - 279  trackbacks - 0
            <2007年10月>
            30123456
            78910111213
            14151617181920
            21222324252627
            28293031123
            45678910

            潛心看書研究!

            常用鏈接

            留言簿(19)

            隨筆分類(81)

            文章分類(89)

            相冊

            ACM OJ

            My friends

            搜索

            •  

            積分與排名

            • 積分 - 218009
            • 排名 - 117

            最新評論

            閱讀排行榜

            評論排行榜

            Sailboat

            Problem H: Sailboat

            In the sailboat race, the contestant is requested to along with the prearrange path. Sailing ship's power comes from wind power and contestant's manpower. The wind power can completely used.

            In a competition, the contestants are requested to along with a 1/4 circles with radius R, the sailboat will goto east from south. During this process, the wind direction is straight from west to the east with constant speed and power.

            In order to maintain the travel direction, the athlete must adjust the sail to the vertical angle from movement direction in any time.

            If the speed of sailboat is proportional to the power at movement direction, the proportional factor is k. Supposes the wind power is f, the athlete manpower is h, please given the time of sailboat from the beginning to the end.

            Input

            The first line of each case consists of 4 double number, that is radius of path: R, wind power: f,athlete manpower: h and proportional factor:k. In order to avoid the floating point error, you needn't output the answer directly. The next line is a integer n, the following n lines gives a double value which is candidate answer.

            Output

            For each candidate of each case, Only "Yes" or "No" should be printed. Output "Yes" if the relative error to your answer is less than 3%, otherwise "No". For example, if the model answer is 100, and the candidate is 98 or 102, you should output "Yes". Output one blank line between neighboring case

            Sample Input

            1.0 2.0 1.0 1.0
            2
            0.35
            0.76
            

            Sample Output

            No
            Yes
            

            Problem Source: provided by skywind

            #include <iostream>
            #include 
            <cmath>
            using namespace std;

            const int MAXN = 100;
            const double PI = acos(-1.0);

            double R, F, H, K, ans;
            int n, cas;

            double func(double x) {
                
            return R / K / (H + F * cos(x));
            }


            double romberg(double a, double b, double EPS = 1e-6{
                
            double t[MAXN][MAXN] = {0}, tmp;
                
            int i, j, k, k2, m, m4;
                t[
            0][0= (func(a) + func(b)) * (b - a) / 2;
                k 
            = 1; k2 = 1;
                
            while (1{
                    tmp  
            = 0;
                    
            for (i = 1; i <= k2; i++{
                        tmp 
            += func(a + (2 * i - 1* (b - a) / (2 * k2));
                    }

                    t[
            0][k] = (t[0][k - 1+ tmp * (b - a) / k2) / 2;
                    
            for (m = 1, m4=4; m <= k; m++, m4 *= 4{
                        t[m][k 
            - m] = (m4 * t[m - 1][k - m + 1- t[m - 1][k - m]) / (m4 - 1);
                    }

                    
            if (fabs(t[k][0- t[k - 1][0]) < EPS) break;
                    k
            ++; k2 *= 2;
                }

                
            return t[k][0];
            }


            void solve() {
                
            double tmp;
                scanf(
            "%lf"&tmp);
                
            if (fabs(tmp - ans) / ans < 0.03) printf("Yes\n");
                
            else printf("No\n");
            }


            int main() {
                freopen(
            "2457.in""r", stdin);
                
            while (scanf("%lf%lf%lf%lf%d"&R, &F, &H, &K, &n) != EOF) {
                    
            if (cas) printf("\n");
                    
            else cas++;
                    ans 
            = romberg(0, PI/2);
                    
            while (n--{
                        solve();
                    }

                }

                
            return 0;
            }
            posted on 2007-10-20 01:02 閱讀(692) 評論(0)  編輯 收藏 引用 所屬分類: 算法&ACM
            久久精品国产99国产精偷| 无码专区久久综合久中文字幕| 精品免费久久久久久久| 国产精品久久成人影院| 午夜精品久久久久久| 国产精品欧美久久久天天影视| 97久久精品无码一区二区天美| 久久精品国产91久久麻豆自制| 青青久久精品国产免费看| 久久精品成人欧美大片| 久久精品国产亚洲精品| 国内精品伊人久久久久av一坑 | 国产精品嫩草影院久久| 亚洲国产精品无码久久久秋霞2| 精品久久777| 久久国内免费视频| 精品久久久久中文字| 亚洲一区二区三区日本久久九| 久久精品国产亚洲av水果派| 午夜精品久久久久久久| 久久久久97国产精华液好用吗| 精品无码久久久久久午夜| 怡红院日本一道日本久久| 久久久久久久综合狠狠综合| 精品99久久aaa一级毛片| 97久久香蕉国产线看观看| 波多野结衣AV无码久久一区| 性高湖久久久久久久久| 久久影院久久香蕉国产线看观看| 久久97久久97精品免视看| 国产三级久久久精品麻豆三级 | 一本色综合网久久| 久久一区二区三区免费| 精品国产91久久久久久久a | 无码超乳爆乳中文字幕久久| 青青热久久国产久精品 | 亚洲欧洲中文日韩久久AV乱码| 久久精品国产亚洲5555| 26uuu久久五月天| 蜜桃麻豆www久久| 久久久国产99久久国产一|