HDU 4716 A Computer Graphics problem (analog AH)

Source: Internet
Author: User

Title Link: http://acm.hdu.edu.cn/showproblem.php?pid=4716


Problem DescriptionIn This problem we talk about the study of computer Graphics. Of course, this was very, very hard.
We have designed a new mobile phone and your task is to write a interface to display battery powers.
Here we use '. ' As empty grids.
When the battery is empty, the interface would look like this:
*------------*|............|| ............|| ............|| ............|| ............|| ............|| ............|| ............|| ............|| ............| *------------*

When the battery was 60% full, the interface would look like this:
*------------*|............|| ............|| ............|| ............|| ------------|| ------------|| ------------|| ------------|| ------------|| ------------|*------------*

Each line there is characters.
Given the battery power the mobile phone left, say X, your task is to output the corresponding interface. Here x'll always be a multiple of ten, and never exceeds 100.
Inputthe first line has a number T (T < ten), indicating the number of test cases.
For all test case there is a single line with a number x. (0 < X <, X is a multiple of 10)
Outputfor 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:*------------*|............| | ............|| ............|| ............|| ------------|| ------------|| ------------|| ------------|| ------------|| ------------|*------------*

Source2013 ACM/ICPC Asia Regional online--warmup2

The code is as follows:

#include <stdio.h> #include <string.h>int main () {int t,i,j,n,cas=1;    scanf ("%d", &t);        while (t--) {scanf ("%d", &n);                          Char mp[20][20]= {"*------------*", "|............|", "|............|", "|............|",                          "|............|",                          "|......... ...|",                          "|............|",                          "|............|",                          "|.                          ...........|",                          "|............|",                          "|............|",        "*------------*"                         };        n/=10;        For (I=1, i<=n; i++) {for (j=1; j<=12; j + +) mp[11-i][j]= '-';        } printf ("Case #%d:\n", cas++);            for (i=0; i<12; i++) {for (j=0; j<14; J + +) {printf ("%c", Mp[i][j]);     }       printf ("\ n"); }} return 0;}


HDU 4716 A Computer Graphics problem (analog AH)

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.