2017 Multi-University Training Contest
来源:互联网 发布:软件类企业安全教育 编辑:程序博客网 时间:2024/06/15 22:06
Questionnaire
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 365 Accepted Submission(s): 284
Total Submission(s): 365 Accepted Submission(s): 284
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 integerT(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
///AC代码
/* ***********************************************┆ ┏┓ ┏┓ ┆┆┏┛┻━━━┛┻┓ ┆┆┃ ┃ ┆┆┃ ━ ┃ ┆┆┃ ┳┛ ┗┳ ┃ ┆┆┃ ┃ ┆┆┃ ┻ ┃ ┆┆┗━┓ 马 ┏━┛ ┆┆ ┃ 勒 ┃ ┆ ┆ ┃ 戈 ┗━━━┓ ┆┆ ┃ 壁 ┣┓┆┆ ┃ 的草泥马 ┏┛┆┆ ┗┓┓┏━┳┓┏┛ ┆┆ ┃┫┫ ┃┫┫ ┆┆ ┗┻┛ ┗┻┛ ┆************************************************ */#include <iostream>#include <set>#include <map>#include <stack>#include <cmath>#include <queue>#include <cstdio>#include <bitset>#include <string>#include <vector>#include <iomanip>#include <cstring>#include <algorithm>#include <functional>#define PI acos(-1)#define eps 1e-8#define inf 0x3f3f3f3f#define debug(x) cout<<"---"<<x<<"---"<<endltypedef long long ll;using namespace std;int main(){ int t; scanf("%d", &t); while (t--) { int n; scanf("%d", &n); int aa = 0, bb = 0, xx; for (int i = 0; i < n; i++) { scanf("%d", &xx); if (xx % 2 == 0) { aa++; } else if (xx % 2 == 1) { bb++; } } if (aa >= bb) { printf("2 0\n"); } else if (aa < bb) { printf("2 1\n"); } } return 0;}/************************************************┆ ┏┓ ┏┓ ┆┆┏┛┻━━━┛┻┓ ┆┆┃ ┃ ┆┆┃ ━ ┃ ┆┆┃ ┳┛ ┗┳ ┃ ┆┆┃ ┃ ┆┆┃ ┻ ┃ ┆┆┗━┓ ┏━┛ ┆┆ ┃ ┃ ┆ ┆ ┃ ┗━━━┓ ┆┆ ┃ AC代马 ┣┓┆┆ ┃ ┏┛┆┆ ┗┓┓┏━┳┓┏┛ ┆┆ ┃┫┫ ┃┫┫ ┆┆ ┗┻┛ ┗┻┛ ┆************************************************ */
阅读全文
0 0
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 《Effective Java 学习笔记 第二章》
- vim命令详解
- 51单片机中断
- Hadoop中的Context使用
- 数据结构之哈希表
- 2017 Multi-University Training Contest
- C语言中volatile关键字的作用
- ECMA-262 V7.0 中关于数据类型和值的说明
- 序列化和反序列化的简单理解
- Axios
- Q-learning算法
- iOS基类Model--BaseModel
- oracle 存储过程初学案例
- Ubuntu 安装 pylucene 踩坑还原记,并安装 SmartChineseAnalyzer