杭电暑期多校集训—Questionnaire
来源:互联网 发布:贝多芬梅毒 知乎 编辑:程序博客网 时间:2024/06/03 09:23
Questionnaire
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
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注意只要输出任意一种结果就行了-。-#include<bits/stdc++.h>using namespace std;int main(){ int t,n; int a[100005]; scanf("%d",&t); while(t--) { int b=0; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d",&a[i]); if(a[i]%2==1) b++; } if(b>n/2) { printf("2 1\n"); } else{ printf("2 0\n"); } } return 0;}
阅读全文
0 0
- 杭电暑期多校集训—Questionnaire
- 杭电暑期多校集训—KazaQ's Socks
- 杭电暑期多校集训—Maximum Sequence
- 杭电暑期多校集训—Is Derek lying?
- 杭电暑期多校集训—Regular polygon
- 杭电暑期多校集训—RXD and math
- 杭电暑期多校集训—RXD's date
- 杭电暑期多校集训—RXD and dividing
- 杭电暑期多校集训—Euler theorem
- 杭电暑期多校集训—Kolakoski
- 杭电暑期多校集训— hard challenge
- 杭电暑期多校集训—Killer Names
- 2009ACM多校联合暑期集训(4)——杭电专场
- 杭电暑期多校集训—Time To Get Up
- 杭电暑期集训-Add More Zero
- 杭电Questionnaire
- hdu-暑假集训-Questionnaire
- hdu 多校联赛 Questionnaire
- 归并排序(Merge Sort)
- Windows 64位下安装Redis
- HADO KART登陆中国 | Meleap发布全球首款HoloLens卡丁车游戏
- vs2013+g2o配置
- Windows安装Virtualenv创建独立Python环境
- 杭电暑期多校集训—Questionnaire
- selenium – webdriver原理
- Python 初学之math模块/random模块/decimal模块/fractions模块
- Java菜鸟教程 for循环和while循环
- HDU6069 Counting Divisors
- STL概述
- Ubuntu删除python惹的祸
- Gym
- hdu6069 Counting Divisors