hdu4716 A Computer Graphics Problem

最新推荐文章于 2019-02-07 14:31:59 发布

15wylu

最新推荐文章于 2019-02-07 14:31:59 发布

阅读量292

点赞数

分类专栏： HDOJ 文章标签： hdu 水题

本文链接：https://blog.csdn.net/qq_32767041/article/details/53367306

版权

HDOJ 专栏收录该内容

75 篇文章 0 订阅

订阅专栏

A Computer Graphics Problem

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

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

#include<iostream>
#include<cstdio>
using namespace std;

int main()
{
	int t,count=1;
	cin>>t;
	while(t--)
	{
		int x;
		cin>>x;
		printf("Case #%d:\n",count++);
		printf("*------------*\n"); 
		for(int i = 0;i<10-x/10;i++)
           printf("|............|\n");  
        for(int i = 0;i<x/10;i++)  
           printf("|------------|\n");
		printf("*------------*\n"); 
	}
	return 0;
}

水题，2013四川省赛A