poj 1323 Game Prediction
来源:互联网 发布:网络直播打赏现象 编辑:程序博客网 时间:2024/05/17 04:49
题目
Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 10475 Accepted: 5046
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.
Input
The input consists of several test cases. The first line of each case contains two integers m (2~20) and n (1~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
Sample Output
Case 1: 2
Case 2: 4
#include <cstdio>#include <cstring>int main(){ int m, n, i, j, tmp, count=1; bool cards[1050]; while(scanf("%d%d", &m, &n) && m && n){ memset(cards, false, sizeof(cards)); for(i=0; i<n; i++){ scanf("%d", &j); cards[j] = true; } int large_cards=0, ans=0; for(i=m*n; i>0; i--){ if(!cards[i]) large_cards++; else{ if(large_cards == 0) ans++; else large_cards--; } } printf("Case %d: %d\n", count, ans); count++; } return 0;}
- POJ 1323 Game Prediction
- poj 1323 Game Prediction
- poj 1323 Game Prediction
- POJ-1323-Game Prediction
- poj 1323 Game Prediction
- poj 1323 Game Prediction
- POJ 1323 Game Prediction
- poj 1323 Game Prediction
- POJ 1323 Game Prediction
- POJ-1323 Game Prediction
- poj 1323 Game Prediction
- POJ | 1323 Game Prediction | 贪心
- POJ 1323 Game Prediction 贪心
- POJ 1323 Game Prediction(贪心)
- POJ 1323 Game Prediction 题解
- POJ 1323 Game Prediction 笔记
- POJ 1323-Game Prediction(贪心)
- POJ——1323 Game Prediction
- php向mysql数据库查询、插入、删除较多条数据
- 阻止微信浏览器的下滑出现空白事件
- springboot的启动Your ApplicationContext is unlikely to start due to a @ComponentScan of the default pac
- 【第3期】量化大咖来了!揭开量化对冲的神秘面纱
- 抽象类和接口的区别
- poj 1323 Game Prediction
- Android Studio配置Kotlin开发环境
- 常用Git命令(by 星空武哥)
- cpulimit安装与使用(CentOS)
- Python从txt文件中逐行读取数据
- Trafodion 查询表占用空间
- 数组删除和数组去重
- 在linux下如何显示隐藏文件
- 微信的全局接口使用凭证access_token和网页授权临时access_token