Questionnaire
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 448 Accepted Submission(s): 338
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 .
![](https://i-blog.csdnimg.cn/blog_migrate/7bd08d012195f9c4e4bb90e78a900471.jpeg)
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.
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
1
6
23 3 18 8 13 9
Sample Output
5 3
题意:给你一组数,让这组数中每个数可以除以m恰好余数等于k,如果满足条件,就是Yes,否则就是No,如果 Yes大于或等于No,就输出m和 k,这样 的m和k不止一组。
分析:本题可以转化为让m永远等于2,然后k的选择只有0和1,再让每个数除以2,判断余数为0的数多还是为1 的数多,谁多,k就等于谁。
#include <iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
#define LL long long
#define max1 100000
int s[max1],h[2];
int main()
{
int T,n;
scanf("%d",&T);
while(T--)
{
h[0]=0;
h[1]=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&s[i]);
if(s[i]%2==1)
{
h[1]++;
}
if(s[i]%2==0)
{
h[0]++;
}
}
if(h[1]>h[0])
{
printf("2 1\n");
}
if(h[1]<h[0])
{
printf("2 0\n");
}
}
return 0;
}