490 - Rotating Sentences (UVa online judge)

 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,
.
"
----------------------------------------------------------------------------------------------------------------------------
 1 #include <cstdio>
 2 #include <cstring>
 3 
 4 const int maxn=100+10;
 5 char data[maxn][maxn];
 6 int length[maxn],max_length=0;
 7 int main(){
 8     int line;
 9     for(line=0;fgets(data[line],maxn,stdin)!=NULL;line++){//fgets()会读入换行符,后添加'\n';
10         length[line]=strlen(data[line])-1;               //而gets()不读入换行符,直接添加'\n'
11         if(length[line]>max_length)
12             max_length=length[line];
13     }
14 
15     for(int i=0;i<max_length;i++){
16         for(int j=line-1;j>=0;j--)
17                 printf("%c",(i<length[j]?data[j][i]:' '));
18         printf("\n");
19     }
20     return 0;
21 }

 

posted @ 2013-07-19 01:00  purgiant  阅读(215)  评论(0编辑  收藏  举报