HDU 4716 A Computer Graphics Problem （水题）

A Computer Graphics Problem

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 43    Accepted Submission(s): 40

Problem Description

In this problem we talk about the study of Computer Graphics. Of course, this is very, very hard.
We have designed a new mobile phone, your task is to write a interface to display battery powers.
Here we use '.' as empty grids.
When the battery is empty, the interface will look like this:

*------------*
|............|
|............|
|............|
|............|
|............|
|............|
|............|
|............|
|............|
|............|
*------------*

When the battery is 60% full, the interface will look like this:

*------------*
|............|
|............|
|............|
|............|
|------------|
|------------|
|------------|
|------------|
|------------|
|------------|
*------------*

Each line there are 14 characters.
Given the battery power the mobile phone left, say x%, your task is to output the corresponding interface. Here x will always be a multiple of 10, and never exceeds 100.

 

 

Input

The first line has a number T (T < 10) , indicating the number of test cases.
For each test case there is a single line with a number x. (0 < x < 100, x is a multiple of 10)

 

 

Output

For test case X, output "Case #X:" at the first line. Then output the corresponding interface.
See sample output for more details.

 

 

Sample Input

2 0 60

 

 

Sample Output

Case #1: *------------* |............| |............| |............| |............| |............| |............| |............| |............| |............| |............| *------------* Case #2: *------------* |............| |............| |............| |............| |------------| |------------| |------------| |------------| |------------| |------------| *------------*

 

 

Source

2013 ACM/ICPC Asia Regional Online —— Warmup2

 

 

Recommend

zhuyuanchen520

 

 

 

 

大水题一发

就是拼手速

 

 

 1 /* ***********************************************
 2 Author        :kuangbin
 3 Created Time  :2013-9-11 12:01:07
 4 File Name     :2013-9-11\1001.cpp
 5 ************************************************ */
 6 
 7 #include <stdio.h>
 8 #include <string.h>
 9 #include <iostream>
10 #include <algorithm>
11 #include <vector>
12 #include <queue>
13 #include <set>
14 #include <map>
15 #include <string>
16 #include <math.h>
17 #include <stdlib.h>
18 #include <time.h>
19 using namespace std;
20 int main()
21 {
22     //freopen("in.txt","r",stdin);
23     //freopen("out.txt","w",stdout);
24     int iCase = 0;
25     int T;
26     int n;
27     scanf("%d",&T);
28     while(T--)
29     {
30         iCase++;
31         printf("Case #%d:\n",iCase);
32         scanf("%d",&n);
33         printf("*");
34         for(int i = 0;i < 12;i++)printf("-");
35         printf("*\n");
36         int t = n/10;
37         for(int i = 0;i < 10-t;i++)
38         {
39             printf("|");
40             for(int j = 0;j < 12;j++)printf(".");
41             printf("|\n");
42         }
43         for(int i = 0;i < t;i++)
44         {
45             printf("|");
46             for(int j = 0;j < 12;j++)printf("-");
47             printf("|\n");
48         }
49         printf("*");
50         for(int i = 0;i < 12;i++)printf("-");
51         printf("*\n");
52 
53 
54     }
55     return 0;
56 }