博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
HDUOJ----A Computer Graphics Problem
阅读量:7089 次
发布时间:2019-06-28

本文共 2690 字,大约阅读时间需要 8 分钟。

A Computer Graphics Problem

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

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
简单题:
代码:
1 #include
2 #include
3 using namespace std; 4 int main() 5 { 6 int i,j,t,n,cnt; 7 scanf("%d",&t); 8 for(cnt=1;cnt<=t;cnt++) 9 {10 scanf("%d",&n);11 printf("Case #%d:\n",cnt);12 for(i=0;i<12;i++)13 {14 for(j=0;j<14;j++)15 {16 if(i==0||i==11)17 {18 if(j==0||j==13)19 printf("*");20 else21 printf("-");22 }23 else24 if(j==0||j==13)25 printf("|");26 else27 if(i<=10-n/10)28 printf(".");29 else30 printf("-");31 }32 puts("");33 }34 }35 return 0;36 }
View Code

 

转载地址:http://mayql.baihongyu.com/

你可能感兴趣的文章
Python全栈之路系列之字符串格式化
查看>>
随手记 - 疯狂触发滚轮事件的Mac触控板
查看>>
大数据相关技术有哪些?
查看>>
和 Pipelining 说再见,cURL 放弃使用管道技术
查看>>
Egg 2.16.2 发布,企业级 Node.js 框架
查看>>
计算几何 - 最近点对 分治法
查看>>
大众继续深耕SUV市场:5款新车型先于上海车展登场,ID. ROOMZZ成点睛之笔 ...
查看>>
使用CODERUN部署阿里云KUBERNETES
查看>>
没有所谓好与不好,只是能否适用和用的好
查看>>
Linux基础命令---gunzip
查看>>
Linux基础命令---文本编辑
查看>>
星矿科技完成千万元融资,专注明星IP价值商业化 ...
查看>>
Linux基础命令---ipcalc计算IP地址
查看>>
一位医疗 AI 创业者的自述:这个行业到底需要什么样的产品?
查看>>
重磅福利,阿里云携手合作伙伴向公益机构免费提供40多种软件服务!
查看>>
MyBatis 自定义 typeHandler
查看>>
MES、ERP已死,中国工业互联网呼唤新的智能模式!
查看>>
SpringMVC请求乱码
查看>>
Java NIO
查看>>
我们的手机用上北斗导航了吗?
查看>>