【Link】:

【Description】

【Solution】



把每个数字长什么样存到数组里就好;傻逼题。

(直接输入每一行是什么样子更快,不要一个字符一个字符地输入)



【NumberOf WA】



1



【Reviw】

【Code】

#include <bits/stdc++.h>
using namespace std; int T;
char s[10][30];
char temp[10][10][7]; int get_ans(int x1,int y1,int x2,int y2){
for (int k = 0;k <= 9;k++){
bool ok = true;
for (int i = x1;i <= x2;i++)
for (int j = y1;j <= y2;j++){
if (temp[k][i-x1+1][j-y1+1]!=s[i][j])
ok = false;
}
if (ok) return k;
}
return 2333;
} int main(){ for (int k = 0;k <= 9;k++)
for (int i = 1;i <= 7;i++)
for (int j = 1;j <= 4;j++)
temp[k][i][j] = '.'; //'0';
for (int i = 2;i <= 3;i++)
temp[0][1][i] = temp[0][7][i] = 'X';
for (int i = 2;i <= 3;i++)
temp[0][i][1] = temp[0][i][4] = 'X';
for (int i = 5;i <= 6;i++)
temp[0][i][1] = temp[0][i][4] = 'X'; //'1';
for (int i = 2;i <= 3;i++)
temp[1][i][4] = 'X';
for (int i = 5;i <= 6;i++)
temp[1][i][4] = 'X'; //'2'
for (int i = 2;i <= 3;i++)
temp[2][1][i] = temp[2][4][i] = temp[2][7][i] = 'X';
for (int i = 2;i <= 3;i++)
temp[2][i][4] = 'X';
for (int i = 5;i <= 6;i++)
temp[2][i][1] = 'X'; //'3'
for (int i = 2;i <= 3;i++)
temp[3][1][i] = temp[3][4][i] = temp[3][7][i] = 'X';
for (int i = 2;i <= 3;i++)
temp[3][i][4] = 'X';
for (int i = 5;i <= 6;i++)
temp[3][i][4] = 'X'; //'4'
for (int i = 2;i <= 3;i++)
temp[4][i][1] = temp[4][i][4] = 'X';
for (int i = 2;i <= 3;i++)
temp[4][4][i] = 'X';
for (int i = 5;i <= 6;i++)
temp[4][i][4] = 'X'; //'5'
for (int i = 2;i <= 3;i++)
temp[5][1][i] = temp[5][4][i] = temp[5][7][i] = 'X';
for (int i = 2;i <= 3;i++)
temp[5][i][1] = 'X';
for (int i = 5;i <= 6;i++)
temp[5][i][4] = 'X'; //'6'
for (int i = 2;i <= 3;i++)
temp[6][1][i] = temp[6][4][i] = temp[6][7][i] = 'X';
for (int i = 2;i <= 3;i++)
temp[6][i][1] = 'X';
for (int i = 5;i <= 6;i++)
temp[6][i][1] = temp[6][i][4] = 'X'; //'7'
for (int i = 2;i <= 3;i++)
temp[7][1][i] = 'X';
for (int i = 2;i <= 3;i++)
temp[7][i][4] = 'X';
for (int i = 5;i <= 6;i++)
temp[7][i][4] = 'X'; //8
for (int i = 2;i <= 3;i++)
temp[8][1][i] = temp[8][4][i] = temp[8][7][i] = 'X';
for (int i = 2;i <= 3;i++)
temp[8][i][1] = temp[8][i][4] = 'X';
for (int i = 5;i <= 6;i++)
temp[8][i][1] = temp[8][i][4] = 'X'; //9
for (int i = 2;i <= 3;i++)
temp[9][1][i] = temp[9][4][i] = temp[9][7][i] = 'X';
for (int i = 2;i <= 3;i++)
temp[9][i][1] = temp[9][i][4] = 'X';
for (int i = 5;i <= 6;i++)
temp[9][i][4] = 'X'; //freopen("F:\\rush.txt","r",stdin);
scanf("%d",&T);
while (T--){
for (int i = 1;i <= 7;i++)
scanf("%s",s[i]+1);
int a = get_ans(1,1,7,4),b = get_ans(1,6,7,9);
int c = get_ans(1,13,7,16),d = get_ans(1,18,7,21);
printf("%d%d:%d%d\n",a,b,c,d);
}
return 0;
}

【2017 Multi-University Training Contest - Team 4】Time To Get Up的更多相关文章

  1. 【2017 Multi-University Training Contest - Team 2】TrickGCD

    [Link]:http://acm.hdu.edu.cn/showproblem.php?pid=6053 [Description] 给你一个b数组,让你求一个a数组: 要求,该数组的每一位都小于等 ...

  2. 【2017 Multi-University Training Contest - Team 2】Maximum Sequence

    [Link]:http://acm.hdu.edu.cn/showproblem.php?pid=6047 [Description] 给你一个数列a和一个数列b; 只告诉你a的前n项各是什么; 然后 ...

  3. 【2017 Multi-University Training Contest - Team 2】 Regular polygon

    [Link]: [Description] 给你n个点整数点; 问你这n个点,能够组成多少个正多边形 [Solution] 整点只能构成正四边形. 则先把所有的边预处理出来; 枚举每某两条边为对角线的 ...

  4. 【2017 Multi-University Training Contest - Team 2】 Is Derek lying?

    [Link]: [Description] 两个人都做了完全一样的n道选择题,每道题都只有'A','B','C' 三个选项,,每道题答对的话得1分,答错不得分也不扣分,告诉你两个人全部n道题各自选的是 ...

  5. 【2017 Multi-University Training Contest - Team 5】Rikka with Competition

    [Link]: [Description] [Solution] 把所有人的能力从大到小排; 能力最大的肯定可能拿冠军; 然后一个一个地往后扫描; 一旦出现a[i-1]-a[i]>k; 则说明从 ...

  6. 【2017 Multi-University Training Contest - Team 5】Rikka with Subset

    [Link]: [Description] 给你a数组的n个数的所有2^n个子集的2^n个子集元素的和; 子集元素的和最大为m; 告诉你各个子集元素的和出现的次数; 如 1 2 则0出现1次,1出现1 ...

  7. 【2017 Multi-University Training Contest - Team 5】Rikka with Graph

    [Link]:http://acm.hdu.edu.cn/showproblem.php?pid=6090 [Description] 给你n个点; 让你在这n个点上最多连m条无向边; 使得 ∑ni= ...

  8. 【2017 Multi-University Training Contest - Team 4】Counting Divisors

    [Link]:http://acm.hdu.edu.cn/showproblem.php?pid=6069 [Description] 定义d(i)为数字i的因子个数; 求∑rld(ik) 其中l,r ...

  9. 【2017 Multi-University Training Contest - Team 3】RXD and math

    [Link]: [Description] [Solution] 发现1010mod(109+7)=999999937; 猜测答案是nk 写个快速幂; 注意对底数先取模; [NumberOf WA] ...

随机推荐

  1. NodeJS学习笔记 进阶 (10)Nodejs 进阶:log4js入门实例(ok))

    个人总结:读完这篇文章讲解了log4js的使用,具体更多可以参考npmjs上看,读完这篇需要15分钟. 摘选自网络 对于线上项目用来说,日志是非常重要的一环.log4js是使用得比较多的一个日志组件, ...

  2. NodeJS代码调试

    1.在Chrome打开chrome://flags/#enable-devtools-experiments 2.激活Developer Tools experiments 3.重启Chrome 4. ...

  3. Java 异常的捕获与处理详解(二)

    (一).throws关键字 throws关键字主要是在定义上使用的,表示的是此方法中不进行异常处理,而交给被调用处处理. 例如: class MyMath { public int div(int x ...

  4. 【Round #36 (Div. 2 only) C】Socks Pairs

    [题目链接]:https://csacademy.com/contest/round-36/task/socks-pairs/ [题意] 给你n种颜色的袜子,每种颜色颜色的袜子有ai只; 假设你在取袜 ...

  5. gcc 生成动态链接库

    http://blog.csdn.net/ngvjai/article/details/8520840 Linux下文件的类型是不依赖于其后缀名的,但一般来讲: .o,是目标文件,相当于windows ...

  6. centos7 安装rsyslog

    http://blog.csdn.net/u011630575/article/details/50896781 http://blog.chinaunix.net/uid-21142030-id-5 ...

  7. Objective-C中的同步线程的锁

    概述 在多线程编程中往往会遇到多个线程同时访问共享的资源,这种情况我们需要通过同步线程来避免.也就是给线程加锁. 因为Objective-C是C语言的超集.,严格的来说是真超集.所以C语言当中的pth ...

  8. 荣耀A55高调上市仅仅为孤独求败?

        坦白说.华为近年来在手机市场上确实取得了一些成绩.比方之前P6的出现就凭借超薄的设计.突出的性价比让大家看到了国产手机的新希望.按理说.在手机市场上尝到甜头的华为应该继续坚持低价.亲民的路线, ...

  9. 【SICP练习】152 练习4.8

    练习4-8 原文 Exercise 4.8. "Named let" is a variant of let that has the form (let <var> ...

  10. WITH common_table_expression (Transact-SQL)

    https://docs.microsoft.com/en-us/sql/t-sql/queries/with-common-table-expression-transact-sql Specifi ...