zoukankan      html  css  js  c++  java
  • 题目不难,还是自己懂得代码太少,纯粹凭思维解题。。努力学吧。。

                                                                     Game Prediction
    Suppose there are M people, including you, playing a special card game. At the beginning, each player receives N cards. The pip of a card is a positive integer which is at most N*M. And there are no two cards with the same pip. During a round, each player chooses one card to compare with others. The player whose card with the biggest pip wins the round, and then the next round begins. After N rounds, when all the cards of each player have been chosen, the player who has won the most rounds is the winner of the game. 
    Given your cards received at the beginning, write a program to tell the maximal number of rounds that you may at least win during the whole game.
     

    Input

    The input consists of several test cases. The first line of each case contains two integers m (2 <= m <= 20) and n (1 <= n <= 50), representing the number of players and the number of cards each player receives at the beginning of the game, respectively. This followed by a line with n positive integers, representing the pips of cards you received at the beginning. Then a blank line follows to separate the cases. 

    The input is terminated by a line with two zeros.
     

    Output

    For each test case, output a line consisting of the test case number followed by the number of rounds you will at least win during the game.
     

    Sample Input

    2 5
    1 7 2 10 9
    6 11 62 63 54 66 65 61 57 56 50 53 48
    0 0
     
     Case 1: 2

    Case 2: 4

    下面是过的代码

    #include<stdio.h>
    main()
    {
    int i,m,n,g,k,t,sum,num;
    int x[1060];
    int z[1060];
    num=1;
    while(scanf("%d %d",&m,&n)!=EOF)
    {if(m==0&&n==0) break;sum=0;
    for(i=1;i<=m*n;i++)
    {z[i]=i;}
    for(i=1;i<=n;i++)
    scanf("%d",&x[i]);
    m=m*n;
    for(i=1;i<=n;i++)
    for(g=1;g<=m;g++)
    {
    if(x[i]==z[g])
    z[g]=1080;
    }
    for(i=1;i<n;i++)
    for(g=i+1;g<=n;g++)
    {if(x[i]<x[g])
    {t=x[i];x[i]=x[g];x[g]=t;}
    }
    for(g=m;g>0;g--)
    for(i=1;i<=n;i++)
    {
    if(z[g]>x[i]&&z[g]!=1080)
    {x[i]=2000;
    break;}
    }
    for(i=1;i<=n;i++)
    {
    if(x[i]!=2000)
    sum++;
    }
    printf("Case %d: %d ",num,sum);
    num++;
    }
    }

    感觉自己写的很幼稚,完全没有算法的美。完全凭思维写,就是按照人脑的步骤复制给程序,非常低级的感觉。。。。。

    前面错的代码也附上:

    原本是想倒序排列一下全部的在比较,一样的就+1不一样就给0

    #include<stdio.h>
    #include<string.h>
    main()
    {
    int i,m,n,g,k,t,sum,num;
    int x[1060];
    int z[1060];
    num=1;
    while(scanf("%d %d",&m,&n)!=EOF)
    {if(m==0&&n==0) break;
    memset(z,0,sizeof(z));
    sum=0;
    for(i=1;i<=n;i++)
    scanf("%d",&x[i]);
    for(i=1;i<n;i++)
    for(g=i+1;g<=n;g++)
    {if(x[i]<x[g])
    {t=x[i];x[i]=x[g];x[g]=t;}
    }
    m=m*n;
    for(i=1;i<=n;i++)
    {
    if(z[i]==0&&x[i]==m)
    {
        sum++;
        z[m]=1;
    }
    else if(z[i]==0&&x[i]<m)
    {
        t=x[i];z[t]=1;z[m]=1;m--;
    }
    m--;
    }
    printf("Case %d: %d
    ",num,sum);
    num++;
    }
    }
  • 相关阅读:
    DOM解析和SAX解析对比
    SAX解析示例代码和原理
    xPath技术
    dom4j工具对XML写入修改删除操作实现
    Dom4j工具j解析XML原理和示例代码
    Servlet的多线程并发问题
    Servlet的自动加载
    servlet缺省路径
    线程安全问题出现 的根本原因和解决方案
    9.12測试(四)——測试笔
  • 原文地址:https://www.cnblogs.com/alexanderone/p/3870316.html
Copyright © 2011-2022 走看看