COCI '06 Contest 1 #3 Okviri

View as PDF

Submit solution


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

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

"Peter Pan frames" are a way of decorating text in which every character is framed by a diamond-shaped frame, with frames of neighbouring characters interleaving. A Peter Pan frame for one letter looks like this (X is the letter we are framing):

..#..
.#.#.
#.X.#
.#.#.
..#..

However, such a framing would be somewhat dull so we'll frame every third letter using a "Wendy frame". A Wendy frame looks like this:

..*..
.*.*.
*.X.*
.*.*.
..*..

When a Wendy frame interleaves with a Peter Pan frame, the Wendy frame (being much nicer) is put on top. For an example of the interleaving check the sample cases.

Input Specification

The first and only line of input will contain at most 15 capital letters of the English alphabet.

Output Specification

Output the word written using Peter Pan and Wendy frames on 5 lines.

Sample Input 1

A

Sample Output 1

..#..
.#.#.
#.A.#
.#.#.
..#..

Sample Input 2

DOG

Sample Output 2

..#...#...*..
.#.#.#.#.*.*.
#.D.#.O.*.G.*
.#.#.#.#.*.*.
..#...#...*..

Sample Input 3

ABCD

Sample Output 3

..#...#...*...#..
.#.#.#.#.*.*.#.#.
#.A.#.B.*.C.*.D.#
.#.#.#.#.*.*.#.#.
..#...#...*...#..

Comments

There are no comments at the moment.