NAJPLOV - Print ♥
Dian is a good programmer recently fall in love (♥). Now she can not think anything without love (♥). She write love on an her computer and mobile where she can. she write love using only ‘*’ and ‘.’ character. she want to write N length love (♥). If she write a N length Love there will be 9×N character of a line and total line is (8-2)×N+2.
Her written 1 length love is:
..*...*.. .*.*.*.*. *...*...* *.......* .*.....*. ..*...*.. ...*.*... ....*....
here every line length is 9 and there are 8 lines.
2 length loves is:
....**......**.... ..**..**..**..**.. ..**..**..**..**.. **......**......** **......**......** **..............** **..............** ..**..........**.. ..**..........**.. ....**......**.... ....**......**.... ......**..**...... ......**..**...... ........**........
Here every line length is 18 and * are double than 1 length love. But the first line and last line print only once time. So total line is 14.
Input
Input start with an integer number T(≤ 1000), which is number of test cases. Each test case contain a integer N (1 ≤ N ≤ 30).
Output
For each case, Print “Case #X:” where X is case number and next line print the love of N length.
There will be a blank line between two cases. See the sample input/output for more clarification.
Example
Input: 3 1 2 3 Output: Case #1: ..*...*.. .*.*.*.*. *...*...* *.......* .*.....*. ..*...*.. ...*.*... ....*.... Case #2: ....**......**.... ..**..**..**..**.. ..**..**..**..**.. **......**......** **......**......** **..............** **..............** ..**..........**.. ..**..........**.. ....**......**.... ....**......**.... ......**..**...... ......**..**...... ........**........ Case #3: ......***.........***...... ...***...***...***...***... ...***...***...***...***... ...***...***...***...***... ***.........***.........*** ***.........***.........*** ***.........***.........*** ***.....................*** ***.....................*** ***.....................*** ...***...............***... ...***...............***... ...***...............***... ......***.........***...... ......***.........***...... ......***.........***...... .........***...***......... .........***...***......... .........***...***......... ............***............
Contest arranged by প্রোগ্রামিং প্রবলেম (Programming Problem in Bengali)
Added by: | Najmuzzaman |
Date: | 2014-10-26 |
Time limit: | 0.5s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |