• <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 閱讀(134) 評論(0)  編輯 收藏 引用
            <2009年2月>
            25262728293031
            1234567
            891011121314
            15161718192021
            22232425262728
            1234567

            常用鏈接

            留言簿(8)

            隨筆檔案

            文章檔案

            Friends

            OJ

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            久久热这里只有精品在线观看| 99久久精品免费看国产| 久久精品成人| 久久亚洲精品中文字幕| 亚洲va久久久噜噜噜久久狠狠| 久久精品国产99久久久香蕉| 久久激情亚洲精品无码?V| 日韩欧美亚洲综合久久影院Ds| 久久精品国产WWW456C0M| 色99久久久久高潮综合影院| 亚洲日韩欧美一区久久久久我| 无码8090精品久久一区| 亚洲色欲久久久综合网| 精品蜜臀久久久久99网站| 久久综合久久综合九色| 久久国产精品国语对白| 亚洲国产成人久久一区WWW| 伊人伊成久久人综合网777| 99久久精品免费看国产一区二区三区| 性做久久久久久久| 久久综合中文字幕| yy6080久久| 精品国产91久久久久久久| 久久精品国产只有精品66| 97精品伊人久久大香线蕉| 久久精品国产91久久综合麻豆自制| 99久久精品九九亚洲精品| 亚洲伊人久久综合影院| 精品无码久久久久国产| 亚洲а∨天堂久久精品| 狠狠色丁香久久综合五月| 国产精品99久久久久久宅男小说| 欧洲精品久久久av无码电影| 精品水蜜桃久久久久久久| 久久亚洲精品国产精品| 久久综合伊人77777麻豆| 国内精品久久久久影院一蜜桃 | 中文成人无码精品久久久不卡| 久久精品人人做人人妻人人玩| 国产巨作麻豆欧美亚洲综合久久| 亚洲va中文字幕无码久久不卡|