HDU 6075 Questionnaire【】
来源:互联网 发布:男神的偶像知乎 编辑:程序博客网 时间:2024/06/05 20:23
Questionnaire
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 307 Accepted Submission(s): 238
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 integerai 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 ofm and k .
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
Please help the team leader to find such pair of
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 integern(3≤n≤100000) in the first line, denoting the number of people in the ACM/ICPC team.
In the next line, there aren distinct integers a1,a2,...,an(1≤ai≤109) , denoting the number that each person chosen.
In each test case, there is an integer
In the next line, there are
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
1623 3 18 8 13 9
Sample Output
5 3
Source
2017 Multi-University Training Contest - Team 4
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<queue>#include<stack>#include<vector>#include<map>#include<set>#include<algorithm>using namespace std;#define ll long long#define ms(a,b) memset(a,b,sizeof(a))#define maxn 510const int M=1e7+10;const int inf=0x3f3f3f3f;const int mod=1e9+7;const double eps=1e-10;int n,m,k;int main(){ int t; scanf("%d",&t); while(t--){ scanf("%d",&n); int sum1=0,sum2=0; for(int i=0;i<n;i++){ int a; scanf("%d",&a); if(a%2)sum1++; else sum2++; } if(sum1<sum2)printf("%d %d\n",2,0); else printf("%d %d\n",2,1); } return 0;}
阅读全文
0 0
- HDU 6075 Questionnaire
- hdu 6075-Questionnaire
- HDU 6075 Questionnaire
- HDU 6075 Questionnaire
- HDU 6075 Questionnaire
- HDU 6075 Questionnaire【】
- HDU 6075 Questionnaire【水题】
- HDU 6075 Questionnaire
- (找规律)HDU 6075 Questionnaire
- HDU 6075 Questionnaire(水~)
- HDU 6075 Questionnaire 水题 判奇偶
- 【多校训练】hdu 6075 Questionnaire
- hdu-暑假集训-Questionnaire
- 2017杭电多校第四场 1009 Questionnaire HDU 6075
- 2017多校联合四1009/hdu 6075Questionnaire思维
- 17暑假多校联赛4.9 HDU 6075 Questionnaire
- 【2017多校第二场】HDU 6075 Questionnaire【思维】
- hdu 多校联赛 Questionnaire
- Django中ORM模型总结(二)[模型类的对应关系,模型类的属性,字段类型]
- Java-HashMap踩坑小记
- Python——切片备忘
- 最大差值(2017某计算机校招笔试试题)
- 百度地图自定义覆盖物及创建多个小图标
- HDU 6075 Questionnaire【】
- 数学、计算机及抽象思维
- poj 1383 Labyrinth【bfs+队列】
- 动态规划中级教程 322. Coin Change
- 如何把footer固定到页面最下端?
- fdfs防盗链配置及java开发
- [数据结构] 排序算法小结
- 二叉树的最大深度和最小深度实现
- 4.1.1—栈—Valid Parentheses