#PU665. USACO 2016 December Contest, Bronze — Problem 3. The Cow-Signal

    ID: 1233 传统题 文件IO:cowsignal 2000ms 256MiB 尝试: 0 已通过: 0 难度: 普及 上传者: 标签>USACO赛事:dec16来源:usaco.orgscoring:equal_test_cases模拟枚举

USACO 2016 December Contest, Bronze — Problem 3. The Cow-Signal

USACO 2016 December Contest, Bronze — Problem 3. The Cow-Signal

题目描述

Bessie and her cow friends are playing as their favorite cow superheroes. Of course, everyone knows that any self-respecting superhero needs a signal to call them to action. Bessie has drawn a special signal on a sheet of M×NM \times N paper (1≤M≤10,1≤N≤101 \leq M \leq 10, 1 \leq N \leq 10), but this is too small, much too small! Bessie wants to amplify the signal so it is exactly KK times bigger (1≤K≤101 \leq K \leq 10) in each direction. The signal will consist only of the '.' and 'X' characters.

输入格式

The first line of input contains MM, NN, and KK, separated by spaces. The next MM lines each contain a length-NN string, collectively describing the picture of the signal.

输出格式

You should output KMKM lines, each with KNKN characters, giving a picture of the enlarged signal.

数据范围

(见题面原文)

样例

样例 1

5 4 2
XXX.
X..X
XXX.
X..X
XXX.
XXXXXX..
XXXXXX..
XX....XX
XX....XX
XXXXXX..
XXXXXX..
XX....XX
XX....XX
XXXXXX..
XXXXXX..
Problem credits: Nathan Pinsker