zoukankan      html  css  js  c++  java
  • 1148

    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

    题解:没理解清题意,看见世界杯,就想着中国队和巴西队,然而并没有这么少的队;

    其实吧,这个题就是说,问卷调查,问除了你还有几个人和你支持同一个队;本渣的思路是:统计x的相同的个数为y,因为,两个人支持同一个队,人数必然相同,那么让这y个x组最小的队,一个x再要x个人可以组一个队,那么找y里面有几个x+1即可,那么代码救出来了;

    代码:

     1 #include<iostream>
     2 #include<algorithm>
     3 #include<cstdio>
     4 #include<cstring>
     5 #include<cmath>
     6 #include<map>
     7 #include<vector>
     8 #include<stack>
     9 #include<queue>
    10 using namespace std;
    11 const int INF=0x3f3f3f3f;
    12 const int MAXN=1e6+10;
    13 int pre[MAXN];
    14 int a[MAXN];
    15 int main(){
    16     int T,N,temp,flot=0;
    17     scanf("%d",&T);
    18     while(T--){
    19         memset(pre,0,sizeof(pre));
    20     scanf("%d",&N);
    21     int pos=0;
    22     for(int i=0;i<N;i++){
    23         scanf("%d",&temp);
    24         if(!pre[temp])
    25             a[pos++]=temp;    
    26             pre[temp]++;
    27     }    
    28     int ans=0,x,y;
    29     for(int i=0;i<pos;i++){
    30         x=a[i];y=pre[a[i]];
    31         ans+=y/(x+1)*(x+1);
    32         if(y%(x+1)!=0)ans+=x+1;
    33     }
    34     printf("Case %d: %d
    ",++flot,ans);
    35     }
    36     return 0;
    37 }

     再次出了这个题,代码;

    #include<iostream>
    #include<cstring>
    #include<cstdio>
    #include<cmath>
    #include<vector>
    #include<map>
    #include<algorithm>
    using namespace std;
    #define mem(x,y) memset(x,y,sizeof(x))
    #define SI(x) scanf("%d",&x)
    #define SL(x) scanf("%lld",&x)
    #define PI(x) printf("%d",x)
    #define PL(x) printf("%lld",x)
    #define P_ printf(" ")
    #define T_T while(T--)
    typedef long long LL;
    const int INF=0x3f3f3f3f;
    const int MAXN=1e6+100;
    int m[MAXN];
    int main(){
    	int T,kase=0,N;
    	SI(T);
    	T_T{
    		SI(N);
    		int x;
    		for(int i=0;i<N;i++){
    			SI(x);
    			m[i]=x+1;
    		}
    		sort(m,m+N);
    		int temp=m[0],flot=1,sum=m[0];
    		for(int i=1;i<N;i++){
    			if(m[i]!=m[i-1]){
    				flot=1;temp=m[i];
    				sum+=temp;
    				continue;
    			}
    				flot++;
    				if(flot>temp)sum+=temp,flot=1;
    				
    		}
    		printf("Case %d: %d
    ",++kase,sum);
    	}
    	return 0;
    }
    

      

      

  • 相关阅读:
    收集于网络的Web Standard规范化CSS+XHTML命名参考
    【转】6 个强大的 HTML5 应用在线开发工具
    【转】2012年度最新免费web开发设计资源荟萃
    优秀网站精选
    【转】inlineblcok 前世今生
    130+ 网页设计工具
    【转】60款很酷的 jQuery 幻灯片演示和下载
    【转载】用CSS3做的动画按钮
    有用网站收集
    『转』Photoshop中改进ios设计流程的30个诀窍
  • 原文地址:https://www.cnblogs.com/handsomecui/p/4907600.html
Copyright © 2011-2022 走看看