Questionnaire

最新推荐文章于 2019-08-25 00:27:20 发布

空巷挽清风

最新推荐文章于 2019-08-25 00:27:20 发布

阅读量383

点赞数

分类专栏： ACM_杂文章标签： acm c语言

本文链接：https://blog.csdn.net/Kong_xiang/article/details/76704096

版权

ACM_杂专栏收录该内容

20 篇文章 0 订阅

订阅专栏

Questionnaire

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 455 Accepted Submission(s): 343
Special Judge

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

解析：这题给我的教训就是英语太渣的话。。。是根本做不出来题的，题目中给出了“输出任意一组可行的数组即可”，，，，，若不是队友的讲解我恐怕到死也不知道测试样例中“5 3”，是怎么来的；除了这个我感觉还是蛮简单的。

下面亮代码：

     C++ Code  
  

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33

#include <iostream>
#include <cstdio>
using namespace std;

int a[ 100005 ];
int main()
{
     int T;
    scanf( "%d" ,&T);
     while (T--)
    {
         int n,j= 0 ,o= 0 ;
        scanf( "%d" ,&n);
         for ( int i= 0 ;i<n;i++)
        {
            scanf( "%d" ,&a[i]);
        }

         for ( int i= 0 ;i<n;i++)
        {
             if (a[i]% 2 == 0 )
                o++;
             else
                j++;
        }
         if (o>=j)
            printf( "2 0\n" );
         else
            printf( "2 1\n" );

    }
     return 0 ;
}