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 1 characters, 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
备注:简单题,看清题意理解就OK了。
#include<stdio.h> #include<string.h> int main() { char s[85]; int n1,n2; int len,i,j; scanf("%s",s); len = strlen(s); n1 = (len+2)/3; n2 = len+2-n1*2; i=0,j=len-1; for(int p=0;p<n1;p++) { if(p==n1-1) { for(int q=0;q<n2;q++) printf("%c",s[i++]); } else { printf("%c",s[i++]); for(int q=0;q<n2-2;q++) printf(" "); printf("%c\n",s[j--]); } } return 0; }