hdoj 1148 - Mad Counting 【水题(模拟)】【周赛】
来源:互联网 发布:javabean和js的区别 编辑:程序博客网 时间:2024/05/29 17:44
Mob was hijacked by the mayor of the Town "TruthTown". Mayor wants Mob to count the total population of the town. Now the naive approach to this problem will be counting people one by one. But as we all know Mob is a bit lazy, so he is finding some other approach so that the time will be minimized. Suddenly he found a poll result of that town where N people were asked "How many people in this town other than yourself support the same team as you in the FIFA world CUP 2010?" Now Mob wants to know if he can find the minimum possible population of the town from this statistics. Note that no people were asked the question more than once.
Input
Input starts with an integer T (≤ 100), denoting the number of test cases.
Each case starts with an integer N (1 ≤ N ≤ 50). The next line will contain N integers denoting the replies (0 to 106) of the people.
Output
For each case, print the case number and the minimum possible population of the town.
Sample Input
Output for Sample Input
2
4
1 1 2 2
1
0
Case 1: 5
Case 2: 1
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int n;int a[55];int main(){int T,N;scanf("%d",&T);N=T;while(T--){scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d",&a[i]);a[i]++;}sort(a+1,a+n+1);int sum=a[1],t=1;for(int i=2;i<=n;i++){if(a[i]==a[i-1]&&t<a[i]){t++;}else{sum+=a[i];t=1;}}printf("Case %d: ",N-T);printf("%d\n",sum);}return 0;}
- hdoj 1148 - Mad Counting 【水题(模拟)】【周赛】
- lightoj 1148 - Mad Counting (数学规律&模拟)
- Light oj 1148 - Mad Counting【模拟】
- lightOJ 1148 - Mad Counting 【水题】
- LightOJ 1148 - Mad Counting【水题+规律】
- LightOJ 1148 - Mad Counting (找规律)
- Lightoj 1148 - Mad Counting (暴力分块)
- lightoj 1148 - Mad Counting 【数学】
- LightOJ 1148 - Mad Counting【数学】
- light oj 1148 - Mad Counting
- LIGHTOJ-1148 - Mad Counting(规律)
- lightoj 1148 - Mad Counting 【一个模拟题 因为看错题目 WA到死。。。】
- LightOJ 1148 - Mad Counting (map运用)
- lightoj 1148 Mad Counting(数学水题)
- Light OJ 1148 - Mad Counting【规律】
- light oj 1148 - Mad Counting 【思维】
- lightoj 1148 - Mad Counting 简单数学
- lightoj1148 - Mad Counting
- Delete Node in a Linked List
- 13、Roman to Integer
- MySQL++简介
- Map集合的三种遍历方式
- uva 12105——Bigger is Better
- hdoj 1148 - Mad Counting 【水题(模拟)】【周赛】
- WinForm实现股票实时查询小程序
- scala并发编程第三章习题
- C#中数组、ArrayList和List三者的区别
- 批处理提高工作效率
- Arduino 平台与C语言程序设计-week2-C Programming-Lesson3
- 鸡心炒青椒【经典菜】
- 栈与队列之用java实现队列
- Mysql++学习(一)------mysql编译安装