## DMPG '16 B3 - CCO

View as PDF

Points: 5
Time limit: 2.0s
Memory limit: 256M

Authors:
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

Bob is now so rich that his ambitions for his purchases have begun to spiral out of control. Everything that he once thought would be able to satisfy his needs no longer comes close. The only way to quench such lofty desires is by making money!

Bob is an expert in information security and is able to effectively cover the tracks of his underground affairs. In order to sustain such a herculean operation, he has hired you to help! Help Bob by printing out the design of the Canadian Counterfeiting Operation illegal tender.

#### Input Specification

Each test case will consist of lines each containing characters, representing the by design to be printed on the bill.

The line afterwards consists of space separated integers , and , representing the value of the bank note and the number of line breaks above and below the central design, and the number of spaces to the left and right of the central design respectively.

#### Output Specification

Your program should output a rectangular array of characters consisting of = characters (ASCII ) along the top and | characters (ASCII ) down the sides.

The value of the counterfeit bill should appear justified in the top-left and bottom-right corners of the tender.

The by design given in the input should be centered in the bill, with lines of space characters (ASCII ) above and below it, and space characters bordering it.

#### Sample Input

[|]
/ \
\_/
100 1 13

#### Sample Output

===============================
|100                          |
|             [|]             |
|             / \             |
|             \_/             |
|                          100|
===============================