山东第7届省赛 K题 Reversed Words

最新推荐文章于 2024-01-14 22:43:53 发布

原创最新推荐文章于 2024-01-14 22:43:53 发布 · 555 阅读

0 ·

CC 4.0 BY-SA版权

模拟只会猜题意同时被 2 个专栏收录

86 篇文章

订阅专栏

省赛真题

55 篇文章

订阅专栏

本文介绍了一道有趣的编程题——翻译一种特殊的外星语言。这种语言的特点是将每个单词反转，但句子中单词的顺序不变。文章提供了示例输入输出，并附带了解题的示例代码。

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

Reversed Words

Time Limit: 2000MS Memory limit: 131072K

题目描述

Some aliens are learning English. They have a very strange way in writing that they revered every word in the sentence but keep all the words in common order. For example when they want to write “one two three”, they will write down “eno owt eerht”.

Now we’ve got some sentence written by these aliens, translate them! And maybe we will know some of their secrets!

输入

Multiple test cases. The first line contains a positive integer T (T <= 1000), indicating the number of test cases.

For each test cases, there will be one line contains only lower case letters and spaces. The length of each line will be no more than 10000. Test cases which are longer than 5000 will be less than 50. Continuous letters are seen as a word, words are separated by spaces. There won’t be two adjacent spaces in the input. Space won’t be the first or the last character.

输出

One line per case, the translated sentence.

示例输入

eno owt eerht

abcde

示例输出

one two three

edcba

提示

来源

“浪潮杯”山东省第七届ACM大学生程序设计竞赛

示例程序

把字符串中的单词反向输出

ACcode：

#include <bits/stdc++.h>
#define maxn 10100
using namespace std;
char dp[maxn];
int main(){
    int n,loop,cnt=1;
    scanf("%d",&loop);
    getchar();
    while(loop--){
        gets(dp);
        int pos=0,len=strlen(dp);
        for(int i=0;i<len;){
            if(dp[i]==' '){
                for(int j=i-1;j>=pos;--j)putchar(dp[j]);
                putchar(' ');
                while(dp[i]==' '&&i<=len)i++;
                pos=i;
            }
            else if(dp[i+1]=='\0'){
                for(int j=i;j>=pos;--j)putchar(dp[j]);
                putchar('\n');
                break;
            }
            else i++;
        }
    }
    return 0;
}