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°,将句子立起来。

注意:1.这里因为句子每行可能有空格,所以不能用scanf函数,所以使用gets()。   2.将句子旋转的时候,短句子输出完后要输出空格。


CODE:

#include 
#include 
#include 

char str[105][105];

int main(){
    int i = 0,j,k,t;
    int m = 0, max=-1, len;
    while(gets(str[m])){        /*读取句子,并记录句子数目和句子最长的长度*/
        len = strlen(str[m]);
        if(max=0; j--){
            if(i

 
 

你可能感兴趣的:(白书UVa做题记录)