UVA - 490 Rotating Sentences

Rotating Sentences

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

题意：

这题就像是矩阵旋转，将字符串旋转90度输出。

解析：

这题原来我是全初始化为空格，然后旋转90度输出，但是WA

后来看了网络上的题解，要先初始化为0，然后遇到0输出空格就AC 了。

#include <stdio.h>
#include <string.h>
const int N = 110;
char str[N][N];
int main() {
	int num = 0;
	int max = - 0x3f3f;
	memset(str,0,sizeof(str));
	while(gets(str[num])) {
		int len = strlen(str[num]);
		if(len > max) {
			max = len;
		}
		num++;
	}
	for(int i = 0; i < max; i++) {
		for(int j = num - 1; j >= 0; j--) {
			if(str[j][i] == 0) 
				putchar(' ');
			else
				putchar(str[j][i]);
		}
		putchar('\n');
	}
	return 0;
}