Hello World for U

找规律 + 按一定格式输出字符。 注：笔者当时提交时用的是”九度online judge“环境，读取字符串时被gets坑了，原来gets在这个系统上有些问题，改为scanf就OK了。

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

 

struct Node

{

     int x;

     int y;

};

char STR[81];

struct Node talbe[76] = {

{2, 3}, {2, 4}, {3, 3}, {3, 4}, {3, 5},

{4, 4}, {4, 5}, {4, 6}, {5, 5}, {5, 6},

{5, 7}, {6, 6}, {6, 7}, {6, 8}, {7, 7},

{7, 8}, {7, 9}, {8, 8}, {8, 9}, {8, 10},

{9, 9}, {9, 10}, {9, 11}, {10, 10}, {10, 11},

{10, 12}, {11, 11}, {11, 12}, {11, 13}, {12, 12},

{12, 13}, {12, 14}, {13, 13}, {13, 14}, {13, 15},

{14, 14}, {14, 15}, {14, 16}, {15, 15}, {15, 16},

{15, 17}, {16, 16}, {16, 17}, {16, 18}, {17, 17},

{17, 18}, {17, 19}, {18, 18}, {18, 19}, {18, 20},

{19, 19}, {19, 20}, {19, 21}, {20, 20}, {20, 21},

{20, 22}, {21, 21}, {21, 22}, {21, 23}, {22, 22},

{22, 23}, {22, 24}, {23, 23}, {23, 24}, {23, 25},

{24, 24}, {24, 25}, {24, 26}, {25, 25}, {25, 26},

{25, 27}, {26, 26}, {26, 27}, {26, 28}, {27, 27},

{27, 28}

};

 

int main()

{

     int len = 0;

     int n1, n2;

     int index;

     int i, j;

 

     while ( scanf ( "%s" , STR) != EOF)

     {

         len = strlen (STR);

         index = len - 5;

         n1 = talbe[index].x;

         n2 = talbe[index].y;

 

         for (i = 0; i < n1 - 1; i++)

         {

             printf ( "%c" , STR[i]);

             for (j = 0; j < n2 - 2; j++)

             {

                 printf ( " " );

             }

             printf ( "%c\n" , STR[len - i - 1]);

         }

         for (j = 0; j < n2; ++j)

         {

             printf ( "%c" , STR[i + j]);

         }

         printf ( "\n" );

     }

     return 0;

}



/**************************************************************

     Problem: 1464

     User:


     Language: C

     Result: Accepted

     Time:10 ms

     Memory:908 kb

****************************************************************/

生成查找表的代码如下：
void calc(int n, int *x, int*y)
{
    int n1 = 0, n2;
    int tmp;

    for(n2 = 3; n2 <= n; n2++)  
    {  
        int tmp = n + 2 - n2;  
        if(tmp % 2 == 0)
        {
            tmp /= 2;
            if (tmp > n1)
            {
                if (tmp <= n2)
                {
                    n1 = tmp;
                    *x = n1;
                    *y = n2;
                }
            }
            else
            {
                break;
            }
        }
    }
}


题目描述：

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.