【多校训练】hdu 6075 Questionnaire

Problem Description

In order to get better results in official ACM/ICPC contests, the team leader comes up with a questionnaire. He asked everyone in the team whether to have more training.



Picture from Wikimedia Commons


Obviously many people don't want more training, so the clever leader didn't write down their words such as ''Yes'' or ''No''. Instead, he let everyone choose a positive integer  ai  to represent his opinion. When finished, the leader will choose a pair of positive interges  m(m>1)  and  k(0≤k<m) , and regard those people whose number is exactly  k  modulo  m  as ''Yes'', while others as ''No''. If the number of ''Yes'' is not less than ''No'', the leader can have chance to offer more training.

Please help the team leader to find such pair of  m  and  k .

 

Input

The first line of the input contains an integer  T(1≤T≤15) , denoting the number of test cases.

In each test case, there is an integer  n(3≤n≤100000)  in the first line, denoting the number of people in the ACM/ICPC team.

In the next line, there are  n  distinct integers  a1,a2,...,an(1≤ai≤109) , denoting the number that each person chosen.

 

Output

For each test case, print a single line containing two integers  m  and  k , if there are multiple solutions, print any of them.

 

Sample Input

  
  

   
   1
6
23 3 18 8 13 9
  
  

 

Sample Output

  
  

   
   5 3
  
  

 

题意：

判断序列模m得k的个数不小于其余的个数，求m和k

思路：

因为是任意一种，把m设为2然后判断奇偶就行

//
//  main.cpp
//  1009
//
//  Created by zc on 2017/8/3.
//  Copyright © 2017年 zc. All rights reserved.
//

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define ll long long
using namespace std;

int main(int argc, const char * argv[]) {
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n;
        scanf("%d",&n);
        int sum=0;
        for(int i=0;i<n;i++)
        {
            ll t;
            scanf("%lld",&t);
            if(t&1) sum++;
        }
        int a;
        if(sum*2<n) a=0;
        else    a=1;
        printf("2 %d\n",a);
    }
}