﻿HDU 5704 Luck Competition-Ocrosoft

# Luck Competition

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 376    Accepted Submission(s): 243

Problem Description
Participants of the Luck Competition choose a non-negative integer no more than 100 in their mind. After choosing their number, let K be the average of all numbers, and M be the result of K×23. Then the lucky person is the one who choose the highest number no more than M. If there are several such people, the lucky person is chosen randomly.
If you are given a chance to know how many people are participating the competition and what their numbers are, calculate the highest number with the highest probability to win assuming that you’re joining the competition.

Input
There are several test cases and the first line contains the number of test cases T(T≤10).
Each test case begins with an integer N(1<N≤100), denoting the number of participants. And next line contains N−1 numbers representing the numbers chosen by other participants.

Output
For each test case, output an integer which you have chosen and the probability of winning (round to two digits after the decimal point), seperated by space.

Sample Input
3
4
1 2 3
4
1 1 2
4
20 30 40


Sample Output
1 0.50
0 1.00
18 1.00


Solution

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <stack>
#include <queue>
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <cctype>
#include <climits>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define ms(a) memset(a,0,sizeof(a))
typedef long long ll;
const int INF = INT_MAX;
const int MAXN = 200 + 10;
using namespace std;
int main()
{
int T;
cin >> T;
while (T--)
{
int n;
int a[MAXN],sum=0;
cin >> n;
for (int i = 1; i < n; i++)
cin >> a[i], sum += a[i];
//假设自己选x，(sum+x)/n*2/3=x，化简x=2*sum/(3*n-2)
int x = 2 * sum / (3 * n - 2);
int cnt = 0;
for (int i = 1; i < n; i++)
{
if (a[i] == x)cnt++;
}
printf("%d %.2lf\n", x, 1.0 / (cnt + 1));
}
return 0;
}