VM7WC '16 #2 Bronze - G

View as PDF

Submit solution

Points: 5
Time limit: 1.0s
Memory limit: 64M

Author:
Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

G is a good letter. Here is a 5 \times 5 image of the letter G, made up of smaller G's:

GGGGG
G....
G..GG
G...G
GGGGG

Since G is such a good letter, we should make it very big. For example, we can increase it to three times the size:

GGGGGGGGGGGGGGG
GGGGGGGGGGGGGGG
GGGGGGGGGGGGGGG
GGG............
GGG............
GGG............
GGG......GGGGGG
GGG......GGGGGG
GGG......GGGGGG
GGG.........GGG
GGG.........GGG
GGG.........GGG
GGGGGGGGGGGGGGG
GGGGGGGGGGGGGGG
GGGGGGGGGGGGGGG

Even though G is such a good letter, we cannot spend time manually increasing the size of G. Write a program to magnify the given 5 \times 5 image of G automatically.

Input Specification

On one line, the positive integer N (1 \leq N \leq 25), how much to magnify the image G. In the example given, N=3.

Output Specification

The output should be 5 \times N lines of 5 \times N characters each: the magnified image of G.


Comments

There are no comments at the moment.