light oj 1148 - Mad Counting
2015-12-06 15:49
357 查看
Mad Counting
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.
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.
PROBLEM SETTER: MUHAMMAD RIFAYAT SAMEE
SPECIAL THANKS: JANE ALAM JAN
题意:民意调查,每一名公民都有盟友,问最少人数。
排序,如果被调查的人有相同盟友人数(n)的个数(cnt)大于这个数+1,即:(cnt > n+1), 该共同的盟友的数量已经超过了盟友容量限度,只能新开来装盟友。
例如 :a 说b是他的盟友!
b说a是他的盟友! 此时容量为2 !最多只能有两个人共同在该盟友对中!
代码:
![]() | PDF (English) | Statistics | Forum |
Time Limit: 0.5 second(s) | Memory Limit: 32 MB |
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
题意:民意调查,每一名公民都有盟友,问最少人数。
排序,如果被调查的人有相同盟友人数(n)的个数(cnt)大于这个数+1,即:(cnt > n+1), 该共同的盟友的数量已经超过了盟友容量限度,只能新开来装盟友。
例如 :a 说b是他的盟友!
b说a是他的盟友! 此时容量为2 !最多只能有两个人共同在该盟友对中!
代码:
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int main() { int T; long long a[1000]; scanf("%d",&T); int S=T; while(T--) { int n,i; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%lld",&a[i]); } sort(a,a+n); long long all=0,num=0; for(i=0;i<n;i++) { if(i==0||a[i]==a[i-1]) num++;//记录该数出现的次数 else { int t=(num+a[i-1])/(a[i-1]+1);//num+a[i-1] 是看一共有多少 出现次数,并向上取整,a[i-1]+1该盟友集合的容量 all+=t*(a[i-1]+1);//取整后进行就按 num=1; } } all+=(num+a[i-1])/(a[i-1]+1)*(a[i-1]+1); printf("Case %d: %lld\n",S-T,all); } return 0; }
相关文章推荐
- 快速学习JavaScript的6个思维技巧
- 暗时间读书笔记
- 你有没有意识到,计算时代已经悄然降临
- 穷人的饥饿思维
- 思维定势
- 关联性思维和给客户展示功能
- 经典的售前思维题目,一个很经典的故事
- 变革思维
- 肯定式探询---组织发展和变革中的积极思维方式
- 从使用Python开发一个Socket示例说到开发者的思维和习惯问题
- 独立思考者模型:避开思维误区的沼泽
- 编程思想——面向对象架构梦想
- 1.去京城的阻碍 。
- 他们的职业分别是什么?
- 浅谈局部思维的误区
- 为什么要学习英语?
- 12306:小宝到农民工的命
- 计算机思维or人的思维
- 4个小启示,给大脑洗洗澡!
- poj 3660 Cow Contest (Floyd+思维)