zoukankan      html  css  js  c++  java
  • A

    Problem description

    The translation from the Berland language into the Birland language is not an easy task. Those languages are very similar: a berlandish word differs from a birlandish word with the same meaning a little: it is spelled (and pronounced) reversely. For example, a Berlandish word code corresponds to a Birlandish word edoc. However, it's easy to make a mistake during the «translation». Vasya translated word s from Berlandish into Birlandish as t. Help him: find out if he translated the word correctly.

    Input

    The first line contains word s, the second line contains word t. The words consist of lowercase Latin letters. The input data do not consist unnecessary spaces. The words are not empty and their lengths do not exceed 100 symbols.

    Output

    If the word t is a word s, written reversely, print YES, otherwise print NO.

    Examples

    Input

    code
    edoc

    Output

    YES

    Input

    abb
    aba

    Output

    NO

    Input

    code
    code

    Output

    NO
    解题思路:检查第一个字符串反转之后是否和第二个字符串相等,是为"YES",否则为"NO"。
    AC代码:
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 int main(){
     4     string s,t;
     5     cin>>s>>t;
     6     reverse(s.begin(),s.end());
     7     if(t==s)cout<<"YES"<<endl;
     8     else cout<<"NO"<<endl;
     9     return 0;
    10 }
  • 相关阅读:
    位运算操作
    C 动态分配内存
    数据查询语言 DQL
    数据操纵语言 ,DML, 增删改
    Convert Sorted List to Binary Search Tree
    Longest Consecutive Sequence
    Binary Tree Postorder Traversal
    Triangle
    4Sum
    3Sum Closest
  • 原文地址:https://www.cnblogs.com/acgoto/p/9141475.html
Copyright © 2011-2022 走看看