light oj 1148 - Mad Counting
来源:互联网 发布:光环大数据培训 梁勇 编辑:程序博客网 时间:2024/04/28 00:08
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 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; }
- light oj 1148 - Mad Counting
- Light OJ 1148 - Mad Counting【规律】
- light oj 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【水题+规律】
- LightOJ 1148 - Mad Counting (map运用)
- Lightoj 1148 - Mad Counting (暴力分块)
- lightoj 1148 Mad Counting(数学水题)
- lightoj 1148 - Mad Counting 简单数学
- LIGHT OJ 1307 - Counting Triangles【二分枚举】
- Light OJ 1307 - Counting Triangles(lower_bound)
- 【light-oj】-’1307 - Counting Triangles(二分)
- lightoj1148 - Mad Counting
- 某畅销理财书读书笔记
- 【Leetcode】Majority Element II
- jstl标签库 stuts2标签OGNL表达式
- RecyclerView使用 及 滑动时加载图片优化方案
- 关于回调函数
- light oj 1148 - Mad Counting
- C语言中使用extern修饰函数要注意(转)
- Matlab 对字符串的处理
- poj 1733 并查集(奇偶校验,判断第一个矛盾)
- 最重要的重构是内心的重构
- Light OJ 1148 - Mad Counting【规律】
- 有向图强连通分量的Tarjan算法
- 圆有点挤
- 利用HFS工具进行文件共享