题目1161：Repeater

#include <cstdio>

using namespace std;

const int N = 3010;

char picture[N][N], buf[N][N];
char temp[6][6];

void draw(int n, int size);

int main()
{
    int n, m;
    int size;

#ifndef ONLINE_JUDGE
    freopen("d:\\OJ\\uva_in.txt", "r", stdin);
#endif

    while (scanf("%d", &n) == 1 && n != 0) {
        getchar();
        for (int i = 0; i < n; i++) {
            gets(temp[i]);
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                picture[i][j] = temp[i][j];
            }
        }

        scanf("%d", &m);
        size = n;

        while (m-- > 1) {
            draw(n, size);
            size *= n;
        }

        for (int i = 0; i < size; i++) {
            for (int j = 0; j < size; j++) {
                printf("%c", picture[i][j]);
            }
            printf("\n");
        }
    }
    return 0;
}


void draw(int n, int size)
{
    for (int i = 0; i < size; i++) {
        for (int j = 0; j < size; j++) {
            buf[i][j] = picture[i][j];
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (temp[i][j] == ' ') {
                for (int x = i * size; x < size * (i + 1); x++) {
                    for (int y = j * size; y < size * (j + 1); y++) {
                        picture[x][y] = ' ';
                    }
                }
            } else {
                for (int x = i * size; x < size * (i + 1); x++) {
                    for (int y = j * size; y < size * (j + 1); y++) {
                        picture[x][y] = buf[x - size * i][y - size * j];
                    }
                }
            }
        }
    }
}