2017多校训练Contest4: 1009 Questionnaire hdu6075
来源:互联网 发布:怎样快速提升淘宝心 编辑:程序博客网 时间:2024/05/20 18:17
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<map>#include<cmath>#include<queue>#include<vector>#include<cstdio>#include<string>#include<cstring>#include<cassert>#include<iostream>#include<algorithm>using namespace std;int main(){int T;scanf("%d",&T);while(T>0){T--;int n;scanf("%d",&n);int i;int sum1=0,sum2=0,x;for(i=1;i<=n;i++){scanf("%d",&x);if(x%2==1)sum1++;elsesum2++;}if(sum1>=sum2)printf("2 1\n");elseprintf("2 0\n");}return 0;}
阅读全文
0 0
- 2017多校训练Contest4: 1009 Questionnaire hdu6075
- 2016多校训练Contest4: 1009 String problem hdu5772
- 2017多校训练Contest4: 1012 Wavel Sequence hdu6078
- 2017多校训练Contest4: 1003 Counting Divisors hdu6069
- 2017多校训练Contest4: 1004 Dirt Ratio hdu6070
- 2017多校训练Contest4: 1005 Lazy Running hdu6071
- 2017多校训练Contest4: 1007 Matching In Multiplication hdu6073
- 【多校训练】hdu 6075 Questionnaire
- HDU6075-Questionnaire
- HDU6075-Questionnaire
- hdu6075 Questionnaire
- 2017多校训练Contest4: 1011 Time To Get Up hdu6077
- 2016多校训练Contest4: 1007 Treasure hdu5770
- 2016多校训练Contest4: 1006 Substring hdu5769
- 2016多校训练Contest4: 1005 Lucky7 hdu5768
- 2016多校训练Contest4: 1011 Where Amazing Happens hdu5774
- 2016多校训练Contest4: 1012 Bubble Sort hdu5775
- 2016多校训练Contest4: 1001 Another Meaning hdu5763
- Java中反射机制(Reflection)学习
- Android NDK编译C++ 'stoi' and 'to_string' is not a member of 'std'
- BIO,NIO,AIO的区别
- DS1821 驱动程序
- CSS布局奇淫巧计之-强大的负边距
- 2017多校训练Contest4: 1009 Questionnaire hdu6075
- Java设计模式——组合模式
- Win10怎么去掉安全警告?暴力关闭安全警告的方法!
- 生物信息学习笔记整理
- 整数分解:即输出整数的每一位数字
- Java 中extends与implements使用方法
- 阿里巴巴js面试题3
- spring boot 使用application.properties 进行外部配置
- 一道有趣的排列、组合、数论、概率问题