PAT-A1031 Hello World for U (20)（模拟）

找到规律，注意N+2能否被3整除是突破点。另一个注意是数组没赋值的位置不能输出（尤其是高维数组），否则出问题，有时候控制台没问题，输入到文件中才会发现问题。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
using namespace std;

#define MAX 1000
char str[MAX];
char graph[100][100];
int main()
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    int l = 0, p = 0;
    int n1 = 0, n2 = 0;
    cin >> str;
    l = strlen(str);
    if (0 == (l+2)%3)
    {
        n1 = n2 = (l+2)/3;
    }
    else
    {
        n1 = (l+2 - (l+2)%3)/3;
        n2 = n1 + (l+2)%3;
    }

    for (int i = 0; i < n1; i++)
        graph[i][0] = str[p++];

    for (int i = 1; i < n2; i++)
        graph[n1-1][i] = str[p++];

    for (int i = n1-2; i >= 0; i--)
        graph[i][n2-1] = str[p++];

    for (int i = 0; i < n1; i++)
    {
        for (int j = 0; j < n2; j++)
            cout << graph[i][j];
        cout << endl;
    }
    //fill
    return 0;
}