HDU6075-Questionnaire
来源:互联网 发布:绝世武神坐骑进阶数据 编辑:程序博客网 时间:2024/06/06 02:54
Questionnaire
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 653 Accepted Submission(s): 447
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
题意:给出n个数,让你找出一对m和k,使得n个数对m取模的答案中k是不小于n/2
解题思路:m取2就很好解决这个问题了
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <functional>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;const LL mod = 998244353;int n;int main(){int t;scanf("%d", &t);while (t--){scanf("%d", &n);int sum1 = 0, sum2 = 0, a;for (int i = 0; i < n; i++){scanf("%d", &a);if (a % 2) sum1++;else sum2++;}if (sum1 >= sum2) printf("2 1\n");else printf("2 0\n");}return 0;}
阅读全文
0 0
- HDU6075-Questionnaire
- HDU6075-Questionnaire
- hdu6075 Questionnaire
- HDU6075 Questionnaire 模拟
- Hdu6075 Questionnaire(2017多校第4场)
- (hdu6075) 2017杭电多校联赛第四场-Questionnaire 思维题
- 2017多校训练Contest4: 1009 Questionnaire hdu6075
- HDU6075 Questionnaire(思路,2017 HDU多校联赛 第4场)
- Questionnaire
- Questionnaire
- hdu6075(思维水题)
- HDU6075(签到水题)
- 杭电Questionnaire
- HDU 6075 Questionnaire
- hdu-暑假集训-Questionnaire
- hdu 6075-Questionnaire
- HDU 6075 Questionnaire
- HDU 6075 Questionnaire
- 数据结构各种排序法及核心思想(冒泡、鸡尾酒、选择、插入、二分法、希尔、堆、归并、快速)
- The content of element type "struts-config" must match的解决方法
- POJ 2482 Stars in Your Window
- 算法--堆排序
- HDU 6073 Matching In Multiplication (拓扑排序+搜索 求二分图所有完美匹配价值和)
- HDU6075-Questionnaire
- java开发导出Excel和Word文档
- Hibernate一对多操作
- effect java 学习摘要(5)
- 我所理解的类方法(classmethod)(关键词:类方法/ClassMethod)
- Codeforces Gym 101128F (UVA Live 7277) Landscaping 最小割
- uva11264-Fire!(两次bfs)
- hash算法原理详解
- XYNUOJ 第一次比赛 魔法公会