HDU 6075 Questionnaire【水题】
来源:互联网 发布:华为大数据新闻 编辑:程序博客网 时间:2024/05/16 23:53
Questionnaire
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 326 Accepted Submission(s): 253
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 <algorithm>#include <cmath>#include <string>#include <map>#include <cstring>#define INF 0x3f3f3f3f#define ms(x,y) memset(x,y,sizeof(x))using namespace std;typedef long long ll;const double pi = acos(-1.0);const double eps = 1e-8;const int maxn = 1e6 + 10;int main(){int t;scanf("%d", &t);while (t--){int n;scanf("%d", &n);int ans = 0;for (int i = 0; i < n; i++){int p;scanf("%d", &p);if (p % 2 == 0){ans++;}}if (ans < n / 2){printf("2 1\n");}else printf("2 0\n");}}
阅读全文
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
- 运行修改后的通讯录!!
- 我是如何获得工学博士学位的?
- swust-Deposit(0197)(线段树)
- Eclipse_Tomcat启动超时
- 【感悟】我曾爱过你
- HDU 6075 Questionnaire【水题】
- appserv安装错误(含apache2.2+php5+mysql+phpmyadmin)
- 原生javascript制作拖拽效果
- hibernate sql 查询
- 每日一发Python---Python yield 使用浅析
- 关于在学术界发展的清单
- RecyclerView和SwipeRefreshLayout
- kubernetes源码之watch包filter.go阅读理解三
- MySql查询优化及其原理