山東省第七屆ACM大學生程式設計競賽-Reversed Words

kewlgrl發表於2016-06-19
ACM程式設計

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.

示例輸入

2
eno owt eerht
abcde

示例輸出

one two three
edcba

提示

 

來源

  “浪潮杯”山東省第七屆ACM大學生程式設計競賽

字串反轉……本來沒什麼好說的……但是！！！
習慣了用C++，然後gets或者cin.getline一行，這樣就出問題了……
用控制檯還看不出來，交了就WA。加了freopen才發現out其實全是空白行。
原因阿，就是cin>>t的後面有個回車符，要把它吃掉，不然就被gets讀到了，下面的字串就讀不到了……
簡直神坑……比賽的時候因為gets坑了兩道題除了這個還有那道爐石水模擬……不說了都是淚……

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define MAXN 10001

int main()
{
#ifdef ONLINE_JUDGE
#else
    freopen("G:/x/read.txt","r",stdin);
    freopen("G:/x/out.txt","w",stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin>>t;
    char a[MAXN];
    cin.getline(a,MAXN);//吃掉回車
    while(t--)
    {
        cin.getline(a,MAXN);//讀入一行
        int i,j,k=-1;
        int len=strlen(a);
        for(i=0; i<=len; ++i)
        {
            if(a[i]==' ')
            {
                for(j=i-1; j>=k+1; --j)
                    cout<<a[j];
                cout<<" ";
                k=i;
            }
            if(i==len)
                for(j=len-1; j>=k+1; --j)
                    cout<<a[j];
        }
        cout<<endl;
    }
    return 0;
}
/*
2
eno owt eerht
abcde
*/


相關文章