hdu6075(思维水题)
来源:互联网 发布:国外代理ip地址和端口 编辑:程序博客网 时间:2024/06/06 03:20
Questionnaire
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 192 Accepted Submission(s): 149
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 intergesm(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 integersm 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<cstdio>#include<iostream>#include<string>using namespace std;const int MAXN=1e5+10;int a;int main(){int t;int n;scanf("%d",&t);while(t--){scanf("%d",&n);int cnt=0;for(int i=0;i<n;i++){scanf("%d",&a);if(a%2==0)cnt++;}if(cnt*2<n)printf("2 1\n");elseprintf("2 0\n");}return 0;}
阅读全文
0 0
- hdu6075(思维水题)
- HDU6075(签到水题)
- (hdu6075) 2017杭电多校联赛第四场-Questionnaire 思维题
- HDU6075-Questionnaire
- HDU6075-Questionnaire
- hdu6075 Questionnaire
- HDU6075 Questionnaire 模拟
- 思维题
- Hdu6075 Questionnaire(2017多校第4场)
- HDU 5670 Machine(水题锻炼思维)
- A. Alyona and copybooks--思维水题
- C. Alyona and mex--思维水题
- codeforce 4B(思维水题)
- 【codeforces】A. Array(思维水题)
- 思维水题:UVa512-Spreadsheet Tracking
- HDU 5596 思维题(逆向思维)*
- 2017多校训练Contest4: 1009 Questionnaire hdu6075
- hdu5112-思维&水
- C++虚函数,纯虚函数的继承
- Libigl实现CPU间的并行
- 84. Largest Rectangle in Histogram
- Leveldb实现原理
- RDD理解及宽依赖和窄依赖
- hdu6075(思维水题)
- JDK1.8时间接口
- 离散事件模拟-银行管理
- 内部类的基础
- 不用加减乘除法做加法 剑指offer
- 富文本编辑器kindEditor简单教程
- 安装或更新CentOS平台的网卡驱动程序
- win10环境下mysql压缩包安装
- hsfgfdg