HDU 4716 A Computer Graphics Problem

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

2060

Sample Output

Case #1:*------------*|............||............||............||............||............||............||............||............||............||............|*------------*Case #2:*------------*|............||............||............||............||------------||------------||------------||------------||------------||------------|
*------------*
简单题,模拟上去就好了。
#include<map>   #include<set>  #include<ctime>    #include<cmath>   #include<stack>#include<queue>     #include<string>    #include<vector>    #include<cstdio>        #include<cstring>      #include<iostream>    #include<algorithm>        #include<functional>    using namespace std;#define ms(x,y) memset(x,y,sizeof(x))        #define rep(i,j,k) for(int i=j;i<=k;i++)        #define per(i,j,k) for(int i=j;i>=k;i--)        #define loop(i,j,k) for (int i=j;i!=-1;i=k[i])        #define inone(x) scanf("%d",&x)        #define intwo(x,y) scanf("%d%d",&x,&y)        #define inthr(x,y,z) scanf("%d%d%d",&x,&y,&z)      #define infou(x,y,z,p) scanf("%d%d%d%d",&x,&y,&z,&p)     #define lson x<<1,l,mid    #define rson x<<1|1,mid+1,r    #define mp(i,j) make_pair(i,j)    #define ff first    #define ss second    typedef long long LL;typedef pair<int, int> pii;const int low(int x) { return x&-x; }const int INF = 0x7FFFFFFF;const int mod = 1e9 + 7;const int N = 1e5 + 10;const double eps = 1e-10;int T, n, cas = 1;int main(){for (inone(T); T--; cas++){inone(n);printf("Case #%d:\n", cas);puts("*------------*");rep(i, 1, 10 - n / 10) puts("|............|");rep(i, 1, n / 10)  puts("|------------|");puts("*------------*");}return 0;}