2017杭电多校联赛team4 Questionnaire 水
2017-08-03 16:55
435 查看
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 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.
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
题目大意:
要使序列中的每个数%m=k,输出任意一组m、k。
思路:
可以令m=2,再统计奇偶性即可。
ac代码:
#include<stdio.h> int main() { int t,n,num,j,o; scanf("%d",&t); while(t--) { scanf("%d",&n); j=o=0; for(int i=0;i<n;i++) { scanf("%d",&num); if(num&1) j++; else o++; } if(j>=o) printf("2 1\n"); else printf("2 0\n"); } return 0; }
相关文章推荐
- 2017 杭电多校联赛第二场 1003 Maximum Sequence(单调队列)HDU 6047
- 2017 杭电多校联赛第二场 1009 TrickGCD(容斥原理) HDU 6053
- (hdu6075) 2017杭电多校联赛第四场-Questionnaire 思维题
- 2017 杭电多校联赛第二场 1001 Is Derek lying? HDU 6045
- 2017杭电多校联赛team3 Kanade's sum hdu6058 快速幂
- 2017 杭电多校联赛第二场 1011 Regular polygon(多个点求正方形个数)POJ 2002
- HDU6075 Questionnaire(思路,2017 HDU多校联赛 第4场)
- 2017 杭电多校联赛 1002 Balala Power!(数字替换字母)HDU 6034
- HDU6095 Rikka with Competition(水题,2017 HDU多校联赛 第5场)
- HDU6063---RXD and math(2017多校联赛题目(???))
- HDU6165 FFF at Valentine(深搜dfs,2017 HDU多校联赛 第9场)
- 2017杭电多校联赛 1011 KazaQ's Socks HDU 6043
- HDU 2017 多校联赛 1001 Add More Zero
- HDU6045 Is Derek lying?(规律,2017 HDU多校联赛 第2场)
- HDU 2017多校联赛-Regular polygon
- HDU6098 Inversion(RMQ,2017 HDU多校联赛 第6场)
- 2017杭电多校联赛6-Inversion-排序-hdu6098
- HDU6181 Two Paths(次短路,路径记录,spfa,2017 HDU多校联赛 第10场)
- HDU 2017 多校联赛 1002 Balala Power!
- HDU 2017多校联赛-1012 Balala Power!