lightoj1148 - Mad Counting
2015-10-24 21:47
351 查看
1148 - 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
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
#include<cstdio> #include<cstdlib> #include<cstring> #include<algorithm> using namespace std; long long num[55]; bool cmp(long long a,long long b){ return a<b; } int main() { int t,i,j,k=1,n; scanf("%d",&t); while(t--){ scanf("%d",&n); long long a; for(i=0;i<n;++i){ scanf("%lld",&num[i]); } sort(num,num+n,cmp); long long sum=0; int d=1;num =-1; for(i=1;i<=n;++i){ if(num[i]!=num[i-1]){ if(d==num[i-1]+1)sum+=d; else if(d>num[i-1]+1){ sum+=(d/(num[i-1]+1))*(num[i-1]+1); if((d/(num[i-1]+1))*(num[i-1]+1)!=d) sum+=num[i-1]+1; } else sum+=num[i-1]+1; d=0; } d++; } printf("Case %d: %lld\n",k++,sum); } return 0; }
相关文章推荐
- 异步流程控制:7 行代码学会 co 模块
- CISCO交换机概览
- 人生的高境界 - 无所谓
- 攻击CISCO路由器
- 个人家园 - 永久免费ASP个人主页空间
- L.WuBi - 发布个最好用的在线五笔编码查询、五笔拆字图解
- 用hta实现制作的无殇 - 快书V1.1打包下载了第1/2页
- Windows SP2 免激活安装版 - DeepinXP PLUS V2 测试版 下载
- 超星图书浏览器(SSReader) v4.00 Bulid 070511 - 数字图书阅览器 下载
- Convenientfox v0.0.1.3 - 基于FireFox的浏览器 下载
- GX::Transcoder v3.20.51.3687 - 音频视频文件转换全能王 下载
- 某市大型汽车网 - vip代码提供下载了
- CSS属性 - white-space 空白属性使用说明
- 测试模式 - XSL教程 - 5
- 选择模式 - XSL教程 - 2
- 匹配模式 - XSL教程 - 4
- XPath入门 - XSL教程 - 3
- 强烈推荐 - Ajax 技术资源中心
- JDBC-ODBC翻页例子
- filewipe - 商用级文件擦除工具 提供下载了