Word Reversal
来源:互联网 发布:java split多个分隔符 编辑:程序博客网 时间:2024/05/21 07:15
Description
For each list of words, output a line with each word reversed without changing the order of the words.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
Input
You will be given a number of test cases. The first line contains a positive integer indicating the number of cases to follow. Each case is given on a line containing a list of words separated by one space, and each word contains only uppercase and lowercase letters.
Output
For each test case, print the output on one line.
Sample Input
1
3
I am happy today
To be or not to be
I want to win the practice contest
Sample Output
I ma yppah yadot
oT eb ro ton ot eb
For each list of words, output a line with each word reversed without changing the order of the words.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
Input
You will be given a number of test cases. The first line contains a positive integer indicating the number of cases to follow. Each case is given on a line containing a list of words separated by one space, and each word contains only uppercase and lowercase letters.
Output
For each test case, print the output on one line.
Sample Input
1
3
I am happy today
To be or not to be
I want to win the practice contest
Sample Output
I ma yppah yadot
oT eb ro ton ot eb
I tnaw ot niw eht ecitcarp tsetnoc
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <cstring>using namespace std;int t,n;int main(){ scanf("%d",&t); for(int mm=1;mm<=t;mm++){ //getchar(); scanf("%d",&n); //string str; getchar(); for(int k=0;k<n;k++){ //getchar(); string str; getline(cin,str,'\n'); //cout<<str<<endl; int len = str.size(); for(int i=0;i<len;i++){ if(str[i]==' '||i==0){ //cout<<i<<endl; int p; if(i!=0) p=i+1; else p=i; while(str[p+1]!=' ' && str[p+1]!='\0') p++; int j; if(i!=0) j=i+1; else j=i; while(j<=p){ swap(str[j],str[p]); j++; p--; } } } cout<<str<<endl; } if(mm!=t) cout<<endl; } return 0;}
0 0
- Word Reversal
- Word Reversal
- Word Reversal
- Word Reversal
- Word Reversal
- Word Reversal
- fjnu 1891 Word Reversal
- zoj acm Word Reversal
- zoj 1151 Word Reversal
- ZOJ 1151 Word Reversal
- zoj 1151.Word Reversal
- ZOJ 1151 Word Reversal
- HOJ 2066 Word Reversal
- zoj 1151 Word Reversal
- zoj 1151 Word Reversal
- ZOJ 1151 Word Reversal
- ZOJ 1151: Word Reversal
- Word Reversal 逆序输出
- ARM体系结构
- Leetcode #30. Substring with Concatenation of All Words 连续子串查找 解题报告
- int与String之间的转换
- 删掉那些显示0Kb,却无法删除的文件(如rar_)
- MySQL学习(四)
- Word Reversal
- css3入门笔记
- 个人网站搭建第一天
- Android Studio 使用AIDL
- 文章标题
- 大二省赛一个月前总结
- 1014-O
- 为什么memset(szBuf, 0, sizeof(szBuf));会莫名其妙core dump?
- 继承关系的初始化方法重写