lightOJ 1148 - Mad Counting 【水题】

原创 2015年11月20日 22:49:04
1148 - Mad Counting
Time Limit: 0.5 second(s) Memory Limit: 32 MB

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

 


PROBLEM SETTER: MUHAMMAD RIFAYAT SAMEE
SPECIAL THANKS: JANE ALAM JAN

思路:

首先将所有的数进行排序,然后将第一个数夹到手sum上,然后看看和前面那个数相同不相同,如果不相同,那么就将这个数加到sum上,然后将cnt=1,如果相同的话,就看看cnt是否下余a[i],如果小于的话,就cnt++,否则的话,就将a[i]加到sum上,cnt=1!
         注意:输入的数为除了本身之外,所以要加1!

代码:

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int a[55];
int main()
{
	int T,N;
	scanf("%d",&T);
	N=T;
	while(T--)
	{
		int n;
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			a[i]+=1;
		}
		printf("Case %d: ",N-T);
		sort(a+1,a+n+1);
		int sum=a[1],cnt=1;
		for(int i=2;i<=n;i++)
		{
			if(a[i]!=a[i-1])
			{
				sum+=a[i];
				cnt=1;
			}
			else
			{
			   	if(cnt<a[i])
					cnt++;
			 	else
			 	{
			 		sum+=a[i];
			 		cnt=1;
			 	}
			}
		}
		printf("%d\n",sum);
	}
	return 0;
}

LightOJ 1148 - Mad Counting【水题+规律】

1148 - Mad Counting PDF (English) Statistics Forum Time Limit: 0.5 second(s) Memory Lim...
  • liuke19950717
  • liuke19950717
  • 2015年10月24日 20:37
  • 234

lightoj 1148 Mad Counting(数学水题)

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=96545#problem/C Description Mob was hija...
  • w144215160044
  • w144215160044
  • 2015年10月26日 16:11
  • 218

F - Mad Counting LightOJ - 1148

Mob was hijacked by the mayor of the Town "TruthTown". Mayor wants Mob to count the total population...
  • gtuif
  • gtuif
  • 2017年07月29日 11:54
  • 81

lightoj 1148 - Mad Counting 【数学】

1148 - Mad Counting PDF (English) Statistics Forum Time Limit: 0.5 second(s) Memory ...
  • longge33445
  • longge33445
  • 2015年10月27日 16:47
  • 188

LightOJ 1148 - Mad Counting【数学】

Mob was hijacked by the mayor of the Town "TruthTown". Mayor wants Mob to count the total population...
  • qq_29600137
  • qq_29600137
  • 2015年12月06日 09:39
  • 164

LightOJ 1148 - Mad Counting (找规律)

Mob was hijacked by the mayor of the Town"TruthTown". Mayor wants Mob to count the total population ...
  • u013534690
  • u013534690
  • 2014年07月26日 00:11
  • 554

LightOJ 1148 - Mad Counting (map运用)

1148 - Mad Counting PDF (English) Statistics Forum Time Limit: 0.5 second(s) ...
  • zwj1452267376
  • zwj1452267376
  • 2015年10月24日 22:24
  • 354

lightoj 1148 - Mad Counting (数学规律&模拟)

1148 - Mad Counting PDF (English) Statistics Forum Time Limit: 0.5 second(s) Memory Limit: 32 MB Mob...
  • yanghui07216
  • yanghui07216
  • 2015年10月24日 20:18
  • 151

lightoj 1148 - Mad Counting 简单数学

统计人数,询问了n个人每个人都回答了除了自己外支持同一球队的其他人数是多少,问最小有多少人。 统计每个数字出现多少次,有a[i]+1个人回答的一样可以刚好组成一个团体...如果有剩余的话也是一个新的...
  • azx736420641
  • azx736420641
  • 2016年04月13日 15:53
  • 194

Lightoj 1148 - Mad Counting (暴力分块)

1148 - Mad Counting PDF (English) Statistics Forum Time Limit: 0.5 second(s) Memory Limit: 32 MB ...
  • helloiamclh
  • helloiamclh
  • 2015年10月25日 11:24
  • 346
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:lightOJ 1148 - Mad Counting 【水题】
举报原因:
原因补充:

(最多只允许输入30个字)