UVA oj 490 Rotating Sentences(字符串)
2016-06-02 00:00
274 查看
Rotating Sentences
Submit Status
Description
![](http://uva.onlinejudge.org/components/com_onlinejudge/images/button_pdf.png)
In ``Rotating Sentences,'' you are asked to rotate a series of input sentences 90 degrees clockwise. So instead of displaying the input sentences from left to right and top to bottom, your program will display them from top to
bottom and right to left.
Input and
As input to your program, you will be given a maximum of 100 sentences, each not exceeding 100 characters long. Legal characters include: newline, space, any punctuation characters, digits, and lower case or upper case English
letters. (NOTE: Tabs are not legal characters.)
The output of the program should have the last sentence printed out vertically in the leftmost column; the first sentence of the input would subsequently end up at the rightmost column.
Time Limit: 3000MS | Memory Limit: Unknown | 64bit IO Format: %lld & %llu |
Description
![](http://uva.onlinejudge.org/components/com_onlinejudge/images/button_pdf.png)
In ``Rotating Sentences,'' you are asked to rotate a series of input sentences 90 degrees clockwise. So instead of displaying the input sentences from left to right and top to bottom, your program will display them from top to
bottom and right to left.
Input and
Output
As input to your program, you will be given a maximum of 100 sentences, each not exceeding 100 characters long. Legal characters include: newline, space, any punctuation characters, digits, and lower case or upper case Englishletters. (NOTE: Tabs are not legal characters.)
The output of the program should have the last sentence printed out vertically in the leftmost column; the first sentence of the input would subsequently end up at the rightmost column.
Sample Input
Rene Decartes once said, "I think, therefore I am."
Sample Output
"R Ie n te h iD ne kc ,a r tt he es r eo fn oc re e s Ia i ad m, . "
这题就是把输入字符串顺时针旋转90度,没有字符的地方用空格补齐,不用文件的输入输出的话看不到测试结果
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; const int maxn = 105; char a[maxn][maxn]; int main() { int maxlen = -1; int i = 0; memset(a,0,sizeof(a)); freopen("in.txt","r",stdin); freopen("out.txt","w",stdout); while(gets(a[i])) { int len = strlen(a[i]); if(maxlen < len) maxlen = len; i++; } for(int j=0;j<maxlen;j++) { for(int k=i-1;k>=0;k--) { if(a[k][j] == 0) printf(" "); else printf("%c",a[k][j]); } printf("\n"); } return 0; }
相关文章推荐
- 数据库链接字符串查询网站
- Flex字符串比较 还有Flex字符串操作
- Ruby中创建字符串的一些技巧小结
- ASP下经常用的字符串等函数参考资料
- 将字符串小写转大写并延时输出的批处理代码
- 将字符串转换成System.Drawing.Color类型的方法
- Lua源码中字符串类型的实现
- Lua性能优化技巧(四):关于字符串
- 字符串聚合函数(去除重复值)
- Ruby中的字符串编写示例
- 总结的5个C#字符串操作方法分享
- sqlserver中求字符串中汉字的个数的sql语句
- sql server字符串非空判断实现方法
- VBS的字符串及日期操作相关函数
- C#实现将千分位字符串转换成数字的方法
- jquery 删除字符串最后一个字符的方法解析
- PowerShell实现在字符串中查找大写字母
- PowerShell中使用Out-String命令把对象转换成字符串输出的例子
- PowerShell中字符串使用单引号和双引号的区别
- Powershell小技巧之获取字符串的行数