Problem--41A--Codeforces--Translation

最新推荐文章于 2023-08-28 09:54:02 发布

小兔叽的甜甜圈

最新推荐文章于 2023-08-28 09:54:02 发布

阅读量893

点赞数

CC 4.0 BY-SA版权

分类专栏： Codeforces

本文链接：https://blog.youkuaiyun.com/qq_36667106/article/details/68489941

Codeforces 专栏收录该内容

35 篇文章

订阅专栏

本文介绍了一个简单的编程问题：如何判断一个字符串是否是另一个字符串的逆序。通过C语言实现了一个小算法，该算法接受两个字符串作为输入，并确定第二个字符串是否为第一个字符串的逆序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A. Translation
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output

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

#include<stdio.h>
#include<string.h>
int main(){
    char str1[105],str2[105],count=0;
    scanf("%s%s",str1,str2);
    int length=strlen(str1);
    for(int i=0;i<length;i++)
    {
        if(str1[i]==str2[length-i-1])
            count++;
    }
    count==length?printf("YES\n"):printf("NO\n");
}