1967: Election

最新推荐文章于 2024-10-05 11:08:05 发布

Nowara_Shinnosuke

最新推荐文章于 2024-10-05 11:08:05 发布

阅读量302

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/Nowara_Shinnosuke/article/details/76011493

版权

数论专栏收录该内容

8 篇文章 0 订阅

订阅专栏

Description

After all the fundraising, campaigning and debating, the election day has finally arrived. Only two candidates remain on the ballot and you work as an aide to one of them.

Reports from the voting stations are starting to trickle in and you hope that you can soon declare a victory.

There are N voters and everyone votes for one of the two candidates (there are no spoiled ballots). In order to win, a candidate needs more than half of the votes. A certain number M ≤ N of ballots have been counted, and there are Vi votes for candidate i (V1+V2 = M), where V1 is the number of votes your candidate received.

Due to the historical data and results of highly scientific polls, you know that each of the remaining votes has a 50% chance to go to your candidate. That makes you think that you could announce the win before all the votes are counted. So, if the probability of winning strictly exceeds a certain threshold W, the victory is yours! We just hope you are sure of this, we don’t want any scandals...

Input

The first line of input contains a single positive integer T ≤ 100 indicating the number of test cases. Next T lines each contain four integers: N, V1, V2 and W as described above.

The input limits are as follows:

1 ≤ N ≤ 50
50 ≤ W < 100
V1, V2 ≥ 0
V1 + V2 ≤ N

Output

For each test case print a single line containing the appropriate action:

If the probability that your candidate will win is strictly greater than W%, print GET A CRATE OF CHAMPAGNE FROM THE BASEMENT!
If your candidate has no chance of winning, print RECOUNT!
Otherwise, print PATIENCE, EVERYONE!

Sample Input

Sample Output

RECOUNT!
PATIENCE, EVERYONE!
PATIENCE, EVERYONE!
GET A CRATE OF CHAMPAGNE FROM THE BASEMENT!

杨辉三角与二项式定理，计算2^n时用(1ll<<n)，先将1转换为long long类型

#include<iostream>
#include<stdio.h>
using namespace std;
const int maxn=51;
typedef long long ll;
ll binom[maxn][maxn];
int main(){
    int t;ll n,v1,v2,w;cin>>t;
    for(int i=0;i<maxn;i++) binom[i][i]=binom[i][0]=1;
    for(int i=1;i<maxn;i++)
        for(int j=1;j<i;j++)
            binom[i][j]=binom[i-1][j-1]+binom[i-1][j];
    while(t--){
        cin>>n>>v1>>v2>>w;
        ll rest=n-v1-v2,p=0;v2+=rest;
        for(int i=0;i<=rest;i++,v1++,v2--)
            if(v2<v1) p+=binom[rest][i];
        if(100*p>w*(1ll<<rest))  printf("GET A CRATE OF CHAMPAGNE FROM THE BASEMENT!\n");
        else if(p==0)            printf("RECOUNT!\n");
        else                     printf("PATIENCE, EVERYONE!\n");
    }
}