12A - Super Agent
2016-07-21 09:42
288 查看
A. Super Agent
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
There is a very secret base in Potatoland where potato mash is made according to a special recipe. The neighbours from Porridgia decided to seize this recipe and to sell it to Pilauland. For this mission they have been preparing special agent Pearlo for many
years. When, finally, Pearlo learned all secrets of espionage, he penetrated into the Potatoland territory and reached the secret base.
Now he is standing at the entrance, but to get inside he need to pass combination lock. Minute ago one of the workers entered the password on the terminal and opened the door. The terminal is a square digital keyboard 3 × 3 with
digits from 1 to 9.
Pearlo knows that the password consists from distinct digits and is probably symmetric with respect to the central button of the terminal. He has heat sensor which allowed him to detect the digits which the worker pressed. Now he wants to check whether the
password entered by the worker is symmetric with respect to the central button of the terminal. This fact can Help Pearlo to reduce the number of different possible password combinations.
Input
Input contains the matrix of three rows of three symbols each. Symbol «X» means that the corresponding button was pressed, and «.»
means that is was not pressed. The matrix may contain no «X», also it may contain no «.».
Output
Print YES if the password is symmetric with respect to the central button of the terminal and NO otherwise.
Examples
input
output
input
output
Note
If you are not familiar with the term «central symmetry», you may look into http://en.wikipedia.org/wiki/Central_symmetry
判断一个正方形是否是中心对称,其实就是翻转一下和原来的字符串的效果一样
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
char a[15]={0},b[15]={0};
for(int i=0;i<3;++i)
{
scanf("%s",a+i*3);
}
strcpy(b,a);//复制
reverse(a,a+9);//翻转
printf("%s\n",strcmp(a,b)==0?"YES":"NO");
return 0;
}
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
There is a very secret base in Potatoland where potato mash is made according to a special recipe. The neighbours from Porridgia decided to seize this recipe and to sell it to Pilauland. For this mission they have been preparing special agent Pearlo for many
years. When, finally, Pearlo learned all secrets of espionage, he penetrated into the Potatoland territory and reached the secret base.
Now he is standing at the entrance, but to get inside he need to pass combination lock. Minute ago one of the workers entered the password on the terminal and opened the door. The terminal is a square digital keyboard 3 × 3 with
digits from 1 to 9.
Pearlo knows that the password consists from distinct digits and is probably symmetric with respect to the central button of the terminal. He has heat sensor which allowed him to detect the digits which the worker pressed. Now he wants to check whether the
password entered by the worker is symmetric with respect to the central button of the terminal. This fact can Help Pearlo to reduce the number of different possible password combinations.
Input
Input contains the matrix of three rows of three symbols each. Symbol «X» means that the corresponding button was pressed, and «.»
means that is was not pressed. The matrix may contain no «X», also it may contain no «.».
Output
Print YES if the password is symmetric with respect to the central button of the terminal and NO otherwise.
Examples
input
XX. ... .XX
output
YES
input
X.X X.. ...
output
NO
Note
If you are not familiar with the term «central symmetry», you may look into http://en.wikipedia.org/wiki/Central_symmetry
判断一个正方形是否是中心对称,其实就是翻转一下和原来的字符串的效果一样
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
char a[15]={0},b[15]={0};
for(int i=0;i<3;++i)
{
scanf("%s",a+i*3);
}
strcpy(b,a);//复制
reverse(a,a+9);//翻转
printf("%s\n",strcmp(a,b)==0?"YES":"NO");
return 0;
}
相关文章推荐
- Largest prime factor(最大素数因子)
- Java poi技术写Excel的Sheet
- hdu 1019
- 如何使用NPM来管理你的Node.js依赖
- Android中国开发精英必须知道的内容
- 关于shape
- 失控的京东高管文化:频繁离职背后原因是什么?
- 41、jQuery(3)
- 用Calendar实现简单的小日历
- webuploader+springMvc+JSP 多图上传实现
- 《GDB命令详解》
- android---重写TextView实现跑马灯
- 关于JavaScript函数及其参数
- @ResponseBody 返回中文乱码问题解决 spingmvc
- 学习Git分布式版本控制系统总结
- 免费打印控件Lodop
- 关于mysql-community-server-5.7.13安装过程
- LINUX系统监视——/proc文件系统(文件夹)
- 智能装备调试和安检问题的解决办法
- 评论