hdu 1338 Game Prediction
来源:互联网 发布:运动员悲情 知乎 编辑:程序博客网 时间:2024/04/27 20:20
D - Game Prediction
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uAppoint description:
Description
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.
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.
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 51 7 2 10 96 1162 63 54 66 65 61 57 56 50 53 480 0
Sample Output
Case 1: 2Case 2: 4
#include <bits/stdc++.h>using namespace std;bool vis[1010];int a[1010];bool cmp(int a,int b){ return a > b;}int main(){ std::ios::sync_with_stdio(false); int n,m; int t = 0; while(cin>>m>>n && (m || n)) { memset(vis,false,sizeof(vis)); for(int i=0; i<n; i++) { cin>>a[i]; vis[a[i]] = true; } sort(a,a+n,cmp); int ant = 0; for(int i=0; i<n; i++) { int j = 0; for(j = a[i] + 1; j <= m * n; j++) { if(!vis[j]) { vis[j] = true; break; } } if(j > m * n) ant++; } cout<<"Case "<<++t<<": "<<ant<<endl; } return 0;}
1 0
- hdu 1338Game Prediction
- hdu 1338 Game Prediction
- HDU 1338 Game Prediction
- HDU -- 1338 Game Prediction
- hdu 1338 Game Prediction
- hdu 1338 Game Prediction
- HDU 1338 Game Prediction
- hdu 1338Game Prediction
- hdu 1338 Game Prediction
- HDU 1338 Game Prediction
- 贪心 hdu-1338-Game Prediction
- HDU 1338 Game Prediction 贪心
- HDU 1338 Game Prediction【贪心】
- HDU 1338 Game Prediction 小想法
- HDOJ 1338 Game Prediction
- hdu——1338——Game Prediction
- 【贪心专题】POJ 1323 && HDU 1338 Game Prediction (贪心)
- HDU 1338 Game Prediction(田忌赛马)
- 高效I/O函数简单整理(部分)
- 实现图片上传
- 【学员版本】CSDN学院套餐常见问题
- Boost下载安装编译配置使用指南(含Windows和Linux)
- 关于Source Insight使用的设置
- hdu 1338 Game Prediction
- XCTools
- 这是我见过的最垃圾的网站!!!!!
- mysql参数优化
- 【MFC】模态、非模态对话框
- 贷款计算
- oracle定时器
- JSON解析
- Eclipse开发Android程序引入第三方jar包的方法