• <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>
            posts - 74,  comments - 33,  trackbacks - 0
            World Cup
            Time Limit: 1000MS Memory Limit: 65536K
            Total Submissions: 3257 Accepted: 1710

            Description

            A World Cup of association football is being held with teams from around the world. The standing is based on the number of points won by the teams, and the distribution of points is done the usual way. That is, when a teams wins a match, it receives 3 points; if the match ends in a draw, both teams receive 1 point; and the loser doesn’t receive any points.

            Given the current standing of the teams and the number of teams participating in the World Cup, your task is to determine how many matches ended in a draw till the moment.

            Input

            The input contains several test cases. The first line of a test case contains two integers T and N, indicating respectively the number of participating teams (0 ≤ T ≤ 200) and the number of played matches (0 ≤ N ≤ 10000). Each one of the T lines below contains the name of the team (a string of at most 10 letter and digits), followed by a whitespace, then the number of points that the team obtained till the moment. The end of input is indicated by T = 0.

            Output

            For each one of the test cases, your program should print a single line containing an integer, representing the quantity of matches that ended in a draw till the moment.

            Sample Input

            3 3
            Brasil 3
            Australia 3
            Croacia 3
            3 3
            Brasil 5
            Japao 1
            Australia 1
            0 0

            Sample Output

            0
            2
            貪心,沒技術含量的一個題
            代碼如下
            #include<stdio.h>
            #include
            <string.h>
            int?main(){
            ????
            int?n,m,i,j;
            ????
            char?str[20];
            ????
            int?goal,sum;
            ????
            while(scanf("%d%d",&n,&m)!=EOF){
            ????????
            if(n==0&&m==0)break;
            ????????sum
            =0;
            ????????
            for(i=0;i<n;i++){
            ????????????getchar();
            ????????????scanf(
            "%s?%d",str,&goal);
            ????????????sum
            +=goal;
            ????????}

            ????????
            while(1){
            ????????????
            if(sum==2*m)break;
            ????????????sum
            -=3;
            ????????????m
            --;????
            ????????}

            ????????printf(
            "%d\n",m);????
            ????}
            ????
            }

            posted on 2009-02-20 11:00 KNIGHT 閱讀(136) 評論(0)  編輯 收藏 引用
            <2025年7月>
            293012345
            6789101112
            13141516171819
            20212223242526
            272829303112
            3456789

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            精品亚洲综合久久中文字幕| 9999国产精品欧美久久久久久| 伊人久久综合无码成人网| 天天躁日日躁狠狠久久| 91久久精品国产91性色也| 欧美亚洲国产精品久久| 久久777国产线看观看精品| 无码任你躁久久久久久老妇App| 久久香蕉超碰97国产精品 | av无码久久久久久不卡网站| 一级做a爰片久久毛片人呢| 亚洲女久久久噜噜噜熟女| 久久国产精品波多野结衣AV| 久久亚洲AV成人无码国产| 精品久久久久久久久免费影院| 久久国产一区二区| 久久天天躁狠狠躁夜夜躁2O2O | 久久婷婷色香五月综合激情| 久久综合久久综合久久综合| 亚洲AV日韩精品久久久久| 午夜精品久久久久久影视777| 久久国产精品99精品国产987| 中文无码久久精品| 久久久精品人妻一区二区三区蜜桃 | 亚洲国产精久久久久久久| 国产V综合V亚洲欧美久久| 中文无码久久精品| 99久久国产宗和精品1上映 | 国产精品99久久免费观看| 婷婷五月深深久久精品| 久久精品aⅴ无码中文字字幕不卡| 人人狠狠综合久久亚洲| 日韩AV毛片精品久久久| 久久久久久无码国产精品中文字幕 | 亚洲av日韩精品久久久久久a | 99久久国产综合精品麻豆| 麻豆亚洲AV永久无码精品久久| 99精品久久精品一区二区| 久久久久久久久波多野高潮| 久久久久久久久久久精品尤物| 久久99热这里只有精品国产|