LightOj 1148 Basic Math

LightOj 1148 Basic Math

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 in 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 rifle at SAMEE
Special thanks: JANE ALAM JAN

Ideas:

There are two arrays respectively for each person's number and the number of people who said this number. Then, divide each number by the number of said numbers and sum up the total sum;

/***********************************    author   : Grant Yuan    time     : 2014/8/21 10:22    algorithm: Basic Math    source   : LightOj 1148************************************/#include
 
  using namespace std;int a[57];int f[57];int main(){    int t,n,ans,sum;    scanf("%d",&t);    for(int i=1;i<=t;i++)    {        memset(a,0,sizeof(a));        memset(f,0,sizeof(f));        scanf("%d",&n);        ans=0;sum=0;        for(int j=0;j