2017 Multi-University Training Contest - Team 4
日常绝望系列
Questionnaire
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 aiai to represent his opinion. When finished, the leader will choose a pair of positive interges m(m>1)m(m>1) and k(0≤k<m)k(0≤k<m), and regard those people whose number is exactly kk modulo mm 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 mm and kk.
InputThe first line of the input contains an integer T(1≤T≤15)T(1≤T≤15), denoting the number of test cases.
In each test case, there is an integer n(3≤n≤100000)n(3≤n≤100000) in the first line, denoting the number of people in the ACM/ICPC team.
In the next line, there are nn distinct integers a1,a2,...,an(1≤ai≤109)a1,a2,...,an(1≤ai≤109), denoting the number that each person chosen.OutputFor 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肯定是2啊，这样的话k只有两种结果，模拟下，so easy
#include<bits/stdc++.h>
using namespace std;
int main(){
int T;
scanf("%d",&T);
while(T--){
int n;
scanf("%d",&n);
int one=;
for(int i=;i<n;i++){
int x;
scanf("%d",&x);
if(x&)one++;
}
int f=;
if(one>=(n+)/)f=;
printf("2 %d\n",f);
}
return ;}
Time To Get Up
Little Q's clock uses a standard 7-segment LCD display for all digits, plus two small segments for the '':'', and shows all times in a 24-hour format. The '':'' segments are on at all times.
Your job is to help Little Q read the time shown on his clock.
InputThe first line of the input contains an integer T(1≤T≤1440)T(1≤T≤1440), denoting the number of test cases.
In each test case, there is an 7×217×21 ASCII image of the clock screen.
All digit segments are represented by two characters, and each colon segment is represented by one character. The character ''X'' indicates a segment that is on while ''.'' indicates anything else. See the sample input for details.OutputFor each test case, print a single line containing a string tt in the format of HH:MMHH:MM, where t(00:00≤t≤23:59)t(00:00≤t≤23:59), denoting the time shown on the clock.Sample Input
1
.XX...XX.....XX...XX.
X..X....X......X.X..X
X..X....X.X....X.X..X
......XX.....XX...XX.
X..X.X....X....X.X..X
X..X.X.........X.X..X
.XX...XX.....XX...XX.
Sample Output
02:38
模拟啦，暴力一下就行，分情况讨论7个位置有没有，表示我在这方面的能力有些弱哎
#include<bits/stdc++.h>
using namespace std;
char s[][];
int dfs(int x,int y){
if(s[x][y+]=='X'){
if(s[x+][y+]!='X'){
if(s[x+][y]=='X')
return ;
else
return ;
}
else{
if(s[x+][y+]!='X'){
if(s[x+][y]=='X')
return ;
else return ;
}
else if(s[x+][y+]!='X')
return ;
else if(s[x+][y]=='X')
return ;
else if(s[x+][y]=='X')
return ;
else return ; }
}
else {
if(s[x+][y]=='X')
return ;
else return ;
}
}
int main(){
int T;
scanf("%d",&T);
while(T--){
getchar();
for(int i=;i<;i++)
scanf("%s",s[i]);
printf("%d%d:%d%d\n",dfs(,),dfs(,),dfs(,),dfs(,));
}
return ;}
最新文章
- SQL分隔字符串
- 多线程之互斥锁（By C++）
- 《Inside UE4》目录
- 关于移动开发的一些想法和认识--Android和iOS
- ZedBoard 引脚约束参考
- 认识Runtime1
- [HIHO1082]然而沼跃鱼早就看穿了一切（字符串水题）
- MongoDB的update有关问题（JAVA）——如何一次更新所有的相同记录
- 使用cocos2d-x制作 Texture unpacker
- iOS开发中一些有用的小代码
- 中国梦&nbsp;&nbsp;每个农大人的梦
- SpringBoot2.0整合Redis
- Windows下U盘管理程序
- 6.Django session
- SSE图像算法优化系列二：高斯模糊算法的全面优化过程分享（一）。
- Adobe photoshop CS5（32位and64位）破解补丁
- 用STL对一组数组进行排序和去重
- Bellman_ford货币兑换——正权回路判断
- s[-1]和s[len(s)-1]
- MyEclipse中出现Address already in use:JVM_Bind:8080