描述
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 lowo That is, the characters must be printed in the original order, starting top-down from the left vertical line with n1 characters, then left to right along the bottom line with n2 characters, and finally bottom-up along the vertical line with n3 characters. And more, we would like U to be as squared as possible – that is, it must be satisfied that n1 = n3 = max { k| k <= n2 for all 3 <= n2 <= N } with n1 + n2 + n3 - 2 = N.
输入描述:
There are multiple test cases.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.
输出描述:
For each test case, print the input string in the shape of U as specified in the description.
示例1
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main() {
char inputstr [80];
char pattern [80][80] = {0};
while (~scanf("%s",inputstr)){
int n1,n2;
int flag = 1;
int n = strlen(inputstr) + 2;
//2*n1 + n2 = N + 2 = n
for(n2 = 3;n2 <= strlen(inputstr) && flag;n2++){
if((n-n2) % 2 == 0){
n1 = (n-n2) / 2;
if(n1 <= n2)
flag = 0;
}
}
for(int i = 0;i < n1 - 1;i++){
printf("%c",inputstr[i]);
for(int j = 0;j < n2 - 3;j++)
printf(" ");
printf("%c\n",inputstr[strlen(inputstr)-1-i]);
}
for(int i = 0;i < n2 - 1;i++)
printf("%c",inputstr[i + n1 - 1]);
printf("\n");
}
return 0;
}