[OJ刷题]题目1464：Hello World for U

2017-03-13

题目：

题目描述：
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.
样例输入：
helloworld!
ac.jobdu.com
样例输出：
h !
e d
l l
lowor
a m
c o
. c
jobdu.

AC Answer:

#include <stdio.h>
#include <string.h>
int main(){
    int p = 0; //字符串个数
    int n2 = 0; //横行输入个数
    int n1 = 0; //纵向输入个数
    char strInput[81]; //字符串最大个数
    for(int i =0;i<81;i++){
        strInput[i] = 0; //初始化字符串数组
    }
    while((scanf("%s",strInput)) != EOF){
        p = strlen(strInput); //计算字符串长度
        int arrayLen = p - 3 + 1; //计算所有可能的N2个数
        int i = 0;
        int a[arrayLen];
        //产生N2数组
        for(i =0;i< arrayLen;i++){
            a[i] = 3 + i;
        }
        //判断第一个满足要求的n2
        for(i = 0;i < arrayLen;i++){
            if((p + 2 - a[i]) % 2 == 0 && a[i] >= (p + 2 - a[i])/2){
                n2 = a[i];
                break;
            }
        }
        n1 = (p + 2 - n2)/2; //计算N1个数
        int j=p-1;
        //输出列
        for(i = 0;i < n1-1;i++){
            printf("%c",strInput[i]);
            for(int i =0;i<n2-2;i++){
                printf("%s"," ");
            }
            printf("%c\n",strInput[j--]);
        }
        //输出行
        for(int i = n1-1;i<p-n1+1;i++){
            printf("%c",strInput[i]);
        }
        puts("");
    }
    return 0;
}

注意点：

判系统是有多组test case输入，所以需要使用while来判断EOF
每组用例输出结果最后一行需要换行

晒图：

1464
14641

最后祝大家刷题愉快！