0123456789 | 프로그래밍의 벗 PivotOJ
PivotOJ

0123456789

시간 제한: 1000ms메모리 제한: 128MB출처: CCC 2002 JuniorBOJ 6916

문제

 _     _  _       _   _  _   _   _
| | |  _| _| |_| |_  |_   | |_| |_|
|_| | |_  _|   |  _| |_|  | |_|  _|

Most digital devices show numbers using a seven segment display. The seven segments are arranged as shown:

 * * *
*     *
*     *
*     *
 * * *
*     *
*     *
*     *
 * * *

For this problem, each segment is represented by three asterisks in a line as shown above.

Any digit from 0 - 9 can be shown by illuminating the appropriate segments. For example, the digit 1 may be displayed using the two segments on the right side:

      *
      *
      *

      *
      *
      *

The digit 4 needs four segments to display it properly:

*     *
*     *
*     *
 * * *
      *
      *
      *

Write a program that will accept a single digit input from the user, and then display that digit using a seven segment display. You may assume that each segment is composed of three asterisks.

BOJ-specific note: None of your lines should contain any trailing whitespace. The last line must end with a newline.

예제

예제 1

입력
9
출력
* * *
*     *
*     *
*     *
 * * *
      *
      *
      *
 * * *
이 문제는 채점 준비 중입니다. 테스트 데이터가 확보되면 제출이 가능합니다.