2017 Multi-University Training Contest

来源：互联网发布：淘宝网信鸽鸽具用品编辑：程序博客网时间：2024/06/05 17:17

questionnaire

#include<iostream>#include<cstdio>using namespace std;int main(){    int T;    scanf("%d",&T);    while(T--)    {    int n,temp;    int e=0,j=0;    scanf("%d",&n);    for(int i=1;i<=n;i++)    {    scanf("%d",&temp);    if(temp%2==0)    {    e++;}else{j++;}}if(j>=e){printf("2 1\n");}else{printf("2 0\n");}}}

Time To Get Up

        #include<iostream>#include<string>#include<cstdio>using namespace std;string t[15]={".XX.X..XX..X....X..XX..X.XX.",          ".......X...X.......X...X....",          ".XX....X...X.XX.X...X....XX.",          ".XX....X...X.XX....X...X.XX.",          "....X..XX..X.XX....X...X....",              ".XX.X...X....XX....X...X.XX.",  ".XX.X...X....XX.X..XX..X.XX.",  ".XX....X...X.......X...X....",  ".XX.X..XX..X.XX.X..XX..X.XX.",  ".XX.X..XX..X.XX....X...X.XX."};      string mb[10];int main(){    int T;scanf("%d",&T);while(T--){for(int i=0;i<7;i++){cin>>mb[i];}int k[4]={0,5,12,17};int sum[6];int pos=0;for(int ks=0;ks<=3;ks++){string temp;    for(int i=0;i<7;i++)    {    for(int j=k[ks];j<k[ks]+4;j++)    {    temp.push_back(mb[i][j]);    }}for(int p=0;p<=9;p++){if(temp==t[p]){sum[pos++]=p;break;}}}printf("%d%d:%d%d\n",sum[0],sum[1],sum[2],sum[3]);}}

阅读全文

0 0