UVa 490 Rotating Sentences (water ver.)

最新推荐文章于 2018-12-05 01:07:04 发布

原创最新推荐文章于 2018-12-05 01:07:04 发布 · 1k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#acm #UVa #c++

UVa 同时被 2 个专栏收录

407 篇文章

订阅专栏

acm之路--模拟

70 篇文章

订阅专栏

本文介绍了一道名为“RotatingSentences”的编程题，任务是将输入的多条句子顺时针旋转90度进行输出。文章详细解释了题目要求，并提供了一个完整的C++实现示例，帮助读者理解如何通过编程解决此类字符串处理问题。

490 - Rotating Sentences

Time limit: 3.000 seconds

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=94&page=show_problem&problem=431

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 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.

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,
.
"

注意短句子后面要输出空格。

完整代码：

/*0.012s*/

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

char in[110][110];
int len[110];

int main(void)
{
	int i, j, idx = 0, Max = 0;
	while (gets(in[idx]))
	{
		len[idx] = strlen(in[idx]);
		Max = max(Max, len[idx++]);
	}
	for (j = 0; j < Max; j++)
	{
		for (i = idx - 1; i >= 0; i--)
			putchar(j < len[i] ? in[i][j] : ' ');
		putchar('\n');
	}
}