http://pat.zju.edu.cn/contests/pat-a-practise/1031
浙大2012年上机复试题A
1031. Hello World for U (20)
时间限制
400 ms
内存限制
32000 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
Given any string of N (>=5) characters, you are asked to form the characters into the shape of U. For example, "helloworld" can be printed as:
h d e l l r lowoThat is, the characters must be printed in the original order, starting top-down from the left vertical line with n 1characters, then left to right along the bottom line with n 2 characters, and finally bottom-up along the vertical line with n 3 characters. And more, we would like U to be as squared as possible -- that is, it must be satisfied that n 1 = n 3 = max { k| k <= n 2 for all 3 <= n 2 <= N } with n 1 + n 2 + n 3 - 2 = N.
Input Specification:
Each input file contains one test case. Each case contains one string with no less than 5 and no more than 80 characters in a line. The string contains no white space.
Output Specification:
For each test case, print the input string in the shape of U as specified in the description.
Sample Input:helloworld!Sample Output:
h ! e d l l lowor
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define MAX_SIZE 1000000000
char str[MAX_SIZE];
int main()
{
int n, n1, n2;
int flag = 0;
scanf("%s", str); // 输入字符串
n = strlen(str); // 字符串长度
for (n2 = 3; n2 <= n; ++n2) // 求n1, n2, n3
{
for (n1 = n2; n1 >= 1; --n1)
{
if (n1 + n2 + n1 - 2 == n)
{
flag = 1;
break;
}
}
if (flag)
break;
}
// 按U型输出字符串
for (int i = 0; i < n1 - 1; ++i)
{
printf("%c", str[i]);
for (int j = 0; j < n2 - 2; ++j)
printf(" ");
printf("%c\n", str[n - i - 1]);
}
for (int i = 0; i < n2; ++i)
{
printf("%c", str[n1 + i - 1]);
}
printf("\n");
return 0;
}