• <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)  編輯 收藏 引用
            <2009年2月>
            25262728293031
            1234567
            891011121314
            15161718192021
            22232425262728
            1234567

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            青青青国产精品国产精品久久久久| 成人国内精品久久久久影院VR| 久久久99精品成人片中文字幕| 久久久精品国产亚洲成人满18免费网站 | 思思久久99热只有频精品66| 国产69精品久久久久9999APGF | 亚洲精品国产成人99久久| 国产成人精品久久一区二区三区av| 久久无码一区二区三区少妇 | 99久久精品国产综合一区 | 国产aⅴ激情无码久久| 成人国内精品久久久久影院| 久久亚洲中文字幕精品一区| 无码超乳爆乳中文字幕久久 | 久久人人青草97香蕉| 精品亚洲综合久久中文字幕| 综合久久一区二区三区| 999久久久无码国产精品| 久久亚洲AV永久无码精品| 精品国产VA久久久久久久冰| 青青热久久国产久精品| 久久九九有精品国产23百花影院| 欧美亚洲国产精品久久| 欧美激情精品久久久久久| 国产精品久久久久影院色| 久久久久久国产精品无码下载| 超级碰久久免费公开视频| jizzjizz国产精品久久| 7777精品久久久大香线蕉| 色婷婷综合久久久久中文字幕| 久久99国产精品二区不卡| 久久久久99精品成人片直播| 国产亚洲精久久久久久无码77777 国产亚洲精品久久久久秋霞 | 青青草原综合久久大伊人精品| 亚洲女久久久噜噜噜熟女| 狠狠色丁香久久婷婷综合蜜芽五月 | 曰曰摸天天摸人人看久久久| 久久国产精品一区二区| 久久91精品国产91久久户| 国产精品美女久久久m| 久久久久久亚洲AV无码专区|