• <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>
            Welcome to Leon's Blog  
            日歷
            <2009年7月>
            2829301234
            567891011
            12131415161718
            19202122232425
            2627282930311
            2345678
            統(tǒng)計(jì)
            • 隨筆 - 30
            • 文章 - 0
            • 評(píng)論 - 51
            • 引用 - 0

            導(dǎo)航

            常用鏈接

            留言簿(4)

            隨筆分類

            隨筆檔案

            ACM

            搜索

            •  

            最新評(píng)論

            閱讀排行榜

            評(píng)論排行榜

             
                 今天做完1006題,第一次用枚舉法,但是時(shí)間復(fù)雜度大,后來(lái)看到帖子說(shuō)是用中國(guó)余數(shù)法。自己試著也寫(xiě)了一個(gè),但是用時(shí)也過(guò)大,現(xiàn)在把代碼貼出來(lái),請(qǐng)大家?guī)兔Ω囊桓陌?!謝謝了!
             1#include <stdio.h>
             2
             3int main(int argc, char* argv[])
             4{
             5    int p,e,i,d, index;
             6    int day;
             7    int x = 28*33*6;
             8    int y = 23*33*19;
             9    int z = 23*28*2;
            10    index = 0;
            11    
            12
            13    do
            14    {
            15        scanf("%d %d %d %d"&p,&e, &i, &d);
            16        if(p == -1 && e == -1 && i == -1 && d == -1)
            17            break;
            18        p = p%23;
            19        e = e%28;
            20        i = i%33;
            21        day = (p*+ e*+ i*z) % 21252;
            22        if(day == d)
            23            day += 21252;
            24        printf("Case %d: the next triple peak occurs in %d days.\n"++index,day->= 0 ? day-d : day-d+21252);
            25    }
            while(1); 
            26    return 0;
            27}
            posted on 2008-05-30 20:43 Leon916 閱讀(1226) 評(píng)論(4)  編輯 收藏 引用
            評(píng)論:
            • # re: 1006求助  夜弓 Posted @ 2008-05-31 07:21
              /*
              Description
              Some people believe that there are three cycles in a person's life that start the day he or she is born. These three cycles are the physical, emotional, and intellectual cycles, and they have periods of lengths 23, 28, and 33 days, respectively. There is one peak in each period of a cycle. At the peak of a cycle, a person performs at his or her best in the corresponding field (physical, emotional or mental). For example, if it is the mental curve, thought processes will be sharper and concentration will be easier.
              Since the three cycles have different periods, the peaks of the three cycles generally occur at different times. We would like to determine when a triple peak occurs (the peaks of all three cycles occur in the same day) for any person. For each cycle, you will be given the number of days from the beginning of the current year at which one of its peaks (not necessarily the first) occurs. You will also be given a date expressed as the number of days from the beginning of the current year. You task is to determine the number of days from the given date to the next triple peak. The given date is not counted. For example, if the given date is 10 and the next triple peak occurs on day 12, the answer is 2, not 3. If a triple peak occurs on the given date, you should give the number of days to the next occurrence of a triple peak.

              Input
              You will be given a number of cases. The input for each case consists of one line of four integers p, e, i, and d. The values p, e, and i are the number of days from the beginning of the current year at which the physical, emotional, and intellectual cycles peak, respectively. The value d is the given date and may be smaller than any of p, e, or i. All values are non-negative and at most 365, and you may assume that a triple peak will occur within 21252 days of the given date. The end of input is indicated by a line in which p = e = i = d = -1.

              Output
              For each test case, print the case number followed by a message indicating the number of days to the next triple peak, in the form:

              Case 1: the next triple peak occurs in 1234 days.

              Use the plural form ``days'' even if the answer is 1.

              Sample Input

              0 0 0 0
              0 0 0 100
              5 20 34 325
              4 5 6 7
              283 102 23 320
              203 301 203 40
              -1 -1 -1 -1

              Sample Output

              Case 1: the next triple peak occurs in 21252 days.
              Case 2: the next triple peak occurs in 21152 days.
              Case 3: the next triple peak occurs in 19575 days.
              Case 4: the next triple peak occurs in 16994 days.
              Case 5: the next triple peak occurs in 8910 days.
              Case 6: the next triple peak occurs in 10789 days.*/
              #include <cstdio>

              int main()
              {
              int x,y,z,s,t;
              size_t i(0);
              scanf("%d %d %d %d", &x, &y, &z, &s);
              while(x!=-1 || y!=-1 || z!=-1 || s!=-1){
              t = (5544*x + 14421*y + 1288*z) % 21252;
              t -= s;
              if(t<=0)
              t+=21252;
              printf("Case %d: the next triple peak occurs in %d days.\n",
              ++i,t);
              scanf("%d %d %d %d", &x, &y, &z, &s);
              }
              }
                回復(fù)  更多評(píng)論   

            • # re: 1006求助  夜弓 Posted @ 2008-05-31 07:31
              感覺(jué)沒(méi)多大區(qū)別,我的比你少取了點(diǎn)模
              40K 75MS
              至于哪些超快的,我覺(jué)得可能是這個(gè)原因:
              那句printf應(yīng)該改成sprintf,先到緩沖區(qū),最后再輸出~
              不過(guò)就算這樣能提高成績(jī),我覺(jué)得其實(shí)意義也不大~  回復(fù)  更多評(píng)論   

            • # re: 1006求助  郴州SEO Posted @ 2008-06-01 07:34
              有點(diǎn)暈...  回復(fù)  更多評(píng)論   

            • # re: 1006求助  Leon916 Posted @ 2008-06-01 11:34
              哦,我在網(wǎng)上看到,有些人寫(xiě)的程序時(shí)間和空間都很少,真不知道是怎么寫(xiě)出來(lái)的  回復(fù)  更多評(píng)論   


            只有注冊(cè)用戶登錄后才能發(fā)表評(píng)論。
            網(wǎng)站導(dǎo)航: 博客園   IT新聞   BlogJava   博問(wèn)   Chat2DB   管理


             
            Copyright © Leon916 Powered by: 博客園 模板提供:滬江博客
            2020久久精品国产免费| 狠狠色婷婷综合天天久久丁香| 国产AⅤ精品一区二区三区久久 | 色偷偷91久久综合噜噜噜噜| 麻豆国内精品久久久久久| 欧美亚洲国产精品久久高清| 久久精品国产亚洲AV大全| 久久久受www免费人成| 亚洲国产精品18久久久久久| 亚洲综合婷婷久久| 久久精品国产亚洲AV无码麻豆 | 国产成人精品免费久久久久| 国产精品99久久久久久宅男| 久久婷婷五月综合色奶水99啪| 久久精品嫩草影院| 无码国内精品久久人妻| 91精品国产91热久久久久福利| 囯产精品久久久久久久久蜜桃| 精品久久久久久久| 亚洲国产精品无码久久久蜜芽| 久久本道久久综合伊人| 久久九九精品99国产精品| 久久久久久精品免费免费自慰| 国产99久久久国产精免费| 久久精品这里热有精品| 亚洲精品无码久久久久sm| 亚洲国产天堂久久久久久| 伊人色综合久久| 国产综合成人久久大片91| 久久久青草久久久青草| 久久精品男人影院| 99久久777色| 国产亚洲欧美精品久久久| 精品乱码久久久久久久| 久久婷婷激情综合色综合俺也去| 日韩欧美亚洲综合久久| 中文字幕亚洲综合久久菠萝蜜| 久久精品国产亚洲av瑜伽| 狠狠色丁香婷婷综合久久来来去 | 日日噜噜夜夜狠狠久久丁香五月| 色播久久人人爽人人爽人人片aV|