Rotating Sentences

最新推荐文章于 2019-07-31 10:04:54 发布

CTTACM

最新推荐文章于 2019-07-31 10:04:54 发布

阅读量449

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM解题文章标签： c++ printf

本文链接：https://blog.youkuaiyun.com/CTTACM/article/details/46731307

ACM解题专栏收录该内容

165 篇文章

订阅专栏

本文介绍了一个名为“旋转句子”的程序设计挑战，该程序接收一系列句子作为输入，并将这些句子顺时针旋转90度进行输出。文章提供了具体的实现代码及样例输入输出，帮助读者理解如何实现这一功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

#include<iostream>
#include<stdio.h>
#include<string>
#include<cstring>
using namespace std;
const int MN = 101;
char a[MN][MN];
int main()
{
	int i=0,m = 0,len[102];
	while(gets(a[i]))
	{
		int t = strlen(a[i]);
		len[i]=t;
		if(t>m) m = t;
		i++;
	}
	int f = i-1;
	for(int j = 0; j != m; j ++){
		for(int k = f; k>=0; k--)
		  if(len[k] > j)
		   cout<<a[k][j];
	      else
	       cout<<" ";
        cout<<endl;
	}
}

有一点就是把句子末尾缺少的部分添加为空格。