lightOJ 1148 - Mad Counting 【水题】

原创 2015年11月20日 22:49:04
1148 - Mad Counting
PDF (English) Statistics Forum
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;
}

hdoj 1148 - Mad Counting 【水题(模拟)】【周赛】

1148 - Mad Counting PDF (English) Statistics Forum Time Limit: 0.5 sec...
  • dxx_111
  • dxx_111
  • 2015年12月06日 22:05
  • 191

LightOJ 1148 - Mad Counting (找规律)

Mob was hijacked by the mayor of the Town"TruthTown". Mayor wants Mob to count the total population ...

Light oj 1148 - Mad Counting【模拟】

1148 - Mad Counting     PDF (English) Statistics Forum Time Limit: 0.5 ...

light oj 1148 - Mad Counting

Mad Counting PDF (English) Statistics Forum Time Limit: 0.5 second(s) ...

lightoj Basic Math 数论基础题 1414+1010+1020+1078+1116+1148+1179+1214+1275+1294+1297+1311+1323+1349+1354

//1008 - Fibsieve`s Fantabulous Birthday//1008 #include #include #include #define LL long long in...

Lightoj 1112 - Curious Robin Hood 【单点修改 + 单点、 区间查询】【树状数组 水题】

1112 - Curious Robin Hood PDF (English) Statistics Forum Time Limit: 1...

Counting Sticks 水题+模拟一下就行了

A. Counting Sticks time limit per test 1 second memory limit per test 256 megabytes input...

POJ - 2386 Lake Counting(DFS连通块水题)

点击打开题目链接 Lake Counting Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 33863   ...

【LightOJ - 1058】Parallelogram Counting

Parallelogram Counting Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu...

【lightoj1307】Counting Triangles

J - J 圆周率用acos(-1.0) 使用longlong Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:lightOJ 1148 - Mad Counting 【水题】
举报原因:
原因补充:

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