• <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  
            日歷
            <2008年6月>
            25262728293031
            1234567
            891011121314
            15161718192021
            22232425262728
            293012345
            統(tǒng)計(jì)
            • 隨筆 - 30
            • 文章 - 0
            • 評(píng)論 - 51
            • 引用 - 0

            導(dǎo)航

            常用鏈接

            留言簿(4)

            隨筆分類

            隨筆檔案

            ACM

            搜索

            •  

            最新評(píng)論

            閱讀排行榜

            評(píng)論排行榜

             
                 今天做完1006題,第一次用枚舉法,但是時(shí)間復(fù)雜度大,后來看到帖子說是用中國余數(shù)法。自己試著也寫了一個(gè),但是用時(shí)也過大,現(xiàn)在把代碼貼出來,請(qǐng)大家?guī)兔Ω囊桓陌。≈x謝了!
             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 閱讀(1223) 評(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
              感覺沒多大區(qū)別,我的比你少取了點(diǎn)模
              40K 75MS
              至于哪些超快的,我覺得可能是這個(gè)原因:
              那句printf應(yīng)該改成sprintf,先到緩沖區(qū),最后再輸出~
              不過就算這樣能提高成績(jī),我覺得其實(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)上看到,有些人寫的程序時(shí)間和空間都很少,真不知道是怎么寫出來的  回復(fù)  更多評(píng)論   


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


             
            Copyright © Leon916 Powered by: 博客園 模板提供:滬江博客
            国产 亚洲 欧美 另类 久久| 国产精品久久久久免费a∨| 久久精品国产亚洲AV蜜臀色欲| 国产亚洲色婷婷久久99精品91| 国产三级久久久精品麻豆三级| 亚洲婷婷国产精品电影人久久| 久久精品一区二区国产| 精品久久久久久成人AV| 久久一日本道色综合久久| 亚洲中文字幕久久精品无码喷水| 精品国产日韩久久亚洲| 青青久久精品国产免费看| 中文字幕精品久久| 亚洲AV无码久久寂寞少妇| 久久亚洲精精品中文字幕| 国内精品久久久久伊人av | 精品久久久久久亚洲精品| 麻豆AV一区二区三区久久| 国产亚洲色婷婷久久99精品| 国产成人久久激情91| 久久久久久国产精品美女| 久久人妻AV中文字幕| 久久婷婷五月综合色奶水99啪 | 国产∨亚洲V天堂无码久久久| 久久精品国产亚洲AV无码麻豆| 久久精品这里热有精品| 久久亚洲精品无码观看不卡| 伊人久久大香线蕉亚洲五月天| 精品久久久久久中文字幕| 久久伊人色| 久久成人精品视频| 亚洲&#228;v永久无码精品天堂久久| 久久人人爽人人爽人人片AV麻豆 | 99久久国产免费福利| 久久人人爽人人爽人人片AV不| 久久久久中文字幕| 亚洲日本久久久午夜精品| 国产69精品久久久久9999| 久久久久久久精品成人热色戒| 99久久精品国产毛片| 久久久久亚洲av无码专区|