[ZOJ 3314] CAPTCHA [模拟]

最新推荐文章于 2016-02-19 17:33:29 发布

jinzhao1994

最新推荐文章于 2016-02-19 17:33:29 发布

阅读量2.7k

点赞数

分类专栏：模拟 ACM ZOJ

本文链接：https://blog.csdn.net/jinzhao1994/article/details/38467245

版权

给26个字母的样子，和一个300*300的矩阵，让你识别出里边都有什么字母...每个字母都不超过7*16。需要识别出180度旋转后的字母。

数据范围很小，直接暴力枚举当前位置开始的是不是一个字母即可。

注意G完全包含C，R完全包含P，E完全包含L....其他的就没什么trick了...

#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;

char table[26][7][17]={
	{
"111111MMM1111111",
"11111MM1MM111111",
"1111MM111MM11111",
"111MMMMMMMMM1111",
"11MM1111111MM111",
"1MMM11111111MM11",
"1MM1111111111MM1"
	},{
"1MMMMMMMMMMM1111",
"1MM11111111MM111",
"1MM11111111MM111",
"1MMMMMMMMMMM1111",
"1MM11111111MM111",
"1MM11111111MM111",
"1MMMMMMMMMMM1111"
	},{
"11111MMMMMMMM111",
"111MM1111111MM11",
"11MM111111111MM1",
"11MM111111111111",
"11MM111111111MM1",
"111MM1111111MM11",
"11111MMMMMMMM111"
	},{
"1MMMMMMMMMMM1111",
"1MM111111111MM11",
"1MM1111111111MM1",
"1MM1111111111MM1",
"1MM1111111111MM1",
"1MM111111111MM11",
"1MMMMMMMMMMM1111"
	},{
"1MMMMMMMMMMMM111",
"1MM1111111111111",
"1MM1111111111111",
"1MMMMMMMMMMMM111",
"1MM1111111111111",
"1MM1111111111111",
"1MMMMMMMMMMMM111"
	},{
"1MMMMMMMMMMMMM11",
"1MM1111111111111",
"1MM1111111111111",
"1MMMMMMMMMMMMM11",
"1MM1111111111111",
"1MM1111111111111",
"1MM1111111111111"
	},{
"11111MMMMMMMM111",
"111