ACM-ICPC-OJ训练营

问题 1828 --Questionnaire

1828: Questionnaire

时间限制: 2 Sec 内存限制: 128 MB Special Judge
提交: 11 解决: 1
[提交][状态][讨论版][命题人:]

题目描述

注意： psj 没解决，先不要交

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

输入描述

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.

输出描述

For each test case, print a single line containing two integers

m and

k, if there are multiple solutions, print any of them.

样例输入

1
6
23 3 18 8 13 9

样例输出

5 3

来源

[提交][状态]