HDU 多校赛 Problem L. Visual Cube problem-6330

最新推荐文章于 2019-10-08 21:15:49 发布

橘堇king

最新推荐文章于 2019-10-08 21:15:49 发布

阅读量172

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/qq_42680202/article/details/81304993

本文提供了一道来自HDU在线评测系统的数学问题的代码解答，通过直接计算的方式解决了一个关于绘制特定图形的问题。代码使用C++编写，展示了如何利用循环和条件判断来生成所需的图形。

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

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=6330

题目很简单就是数学问题了直接贴代码，花时间算算就出来了

#include <iostream>
#include <cstdio>
#include <set>
#include <cstring>
#define MAXN 100100
using namespace std;
int main()
{
    int t;
    char cod[400][400];
    scanf("%d", &t);
    while(t--)
    {
        memset(cod, ' ', sizeof(cod));
        int l, w, h;
        scanf("%d%d%d", &l, &w, &h);
        for(int i = 2*w+2*h; i >= 2*w+2; i -= 2)
        {
            for(int j = 1; j <= 2*l+1; j += 2)
            {
                cod[i][j] = '|';
                if(j != 2*l+1)
                    cod[i][j+1] = '.';
            }
        }
        for(int i = 2*w+2*h+1; i >= 2*w+2-1; i -= 2)
        {
            for(int j = 1; j <= 2*l+1; j += 2)
            {
                cod[i][j] = '+';
                if(j != 2*l+1)
                    cod[i][j+1] = '-';
            }
        }
        for(int i = 2; i <= 2*w; i += 2)
        {
            for(int j = 2*w-i+2; j <= 2*w+2*l-i+2; j+= 2)
            {
                cod[i][j] = '/';
                if(j != 2*w+2*l-i+2)
                    cod[i][j+1] = '.';
            }
        }
        for(int i = 2-1; i <= 2*w-1; i += 2)
        {
            for(int j = 2*w-i+2; j <= 2*w+2*l-i+2; j+= 2)
            {
                cod[i][j] = '+';
                if(j != 2*w+2*l-i+2)
                    cod[i][j+1] = '-';
            }
        }
        int k = 0;
        for(int j = 2*w+2*l+1; j >= 2*l+2; j-= 2)
        {
            for(int i = 2+k; i <= 2*h+k; i += 2)
            {
                cod[i][j] = '|';
                cod[i+1][j] = '+';
            }
            k += 2;
        }
        k = 0;
        for(int j = 2*w+2*l+1-1; j >= 2*l+2-1; j-= 2)
        {
            for(int i = 2+k+2; i <= 2*h+k+2; i += 2)
            {
                cod[i][j] = '/';
                cod[i+1][j] = '.';
            }
            k += 2;
        }
        for(int i = 1; i <= 2*w+2*h+1; i++)
        {
            for(int j = 1; j <= 2*w+2*l+1; j++)
            {
                if(cod[i][j] == ' ')
                    cout << '.';
                else
                    cout << cod[i][j];
            }    
            cout << endl;
        }
    }
}