HDU4716-A Computer Graphics Problem

最新推荐文章于 2019-09-21 20:24:08 发布

原创最新推荐文章于 2019-09-21 20:24:08 发布 · 300 阅读

0 ·

CC 4.0 BY-SA版权

HDU 同时被 2 个专栏收录

490 篇文章

订阅专栏

----水题

234 篇文章

订阅专栏

本文介绍了一种通过编程实现的手机电池电量显示接口设计方法。根据剩余电量百分比，使用不同的字符来展示电池状态，例如空格和下划线等。文章提供了完整的代码示例，演示了如何根据不同电量水平输出相应的视觉效果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A Computer Graphics Problem

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

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

Sample Output

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

Source

2013 ACM/ICPC Asia Regional Online —— Warmup2

Recommend

zhuyuanchen520

题意：从上到下将x%的.变为_

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <functional>
#include <climits>

using namespace std;

int main()
{
    int T,n;
    while(~scanf("%d",&T))
    {
        int q=1;
        while(T--)
        {scanf("%d",&n);
            printf("Case #%d:\n",q++);
            n/=10;
            printf("*------------*\n");
            for(int i=0;i<10-n;i++)
                 printf("|............|\n");
            for(int i=0;i<n;i++)
                printf("|------------|\n");
            printf("*------------*\n");
        }
    }
    return 0;
}