当前位置:网站首页>HZOJ #240. 图形打印四
HZOJ #240. 图形打印四
2022-07-07 10:36:00 【段舸】
题目:240. 图形打印四
题目传送门:240题
样例输入
1
2
3
4
-1
样例输出
X
-
X X
X
X X
-
X X X X
X X
X X X X
X X
X
X X
X X X X
X X
X X X X
-
X X X X X X X X
X X X X
X X X X X X X X
X X X X
X X
X X X X
X X X X X X X X
X X X X
X X X X X X X X
X X X X
X X
X X X X
X X
X
X X
X X X X
X X
X X X X
X X X X X X X X
X X X X
X X X X X X X X
X X X X
X X
X X X X
X X X X X X X X
X X X X
X X X X X X X X
-
数据规模与约定
时间限制:1 s
内存限制:256 M
100% 的数据保证 1≤n≤7
代码
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
char ans[1005][1005];
int num[10] = { 0,1,3,9,27,81,243,729 };
void func(int x, int y, int n)
{
if (n == 1) {
ans[x][y] = 'X';
return;
}
func(x, y, n - 1);
func(x, y + num[n] / 3 * 2, n - 1);
func(x + num[n] / 3 * 2, y, n - 1);
func(x + num[n] / 3, y + num[n] / 3, n - 1);
func(x + num[n] / 3 * 2, y + num[n] / 3 * 2, n - 1);
}
int main()
{
func(1, 1, 7);
int n;
while (cin >> n)
{
if (n == -1) {
break;
}
for (int i = 1; i <= num[n]; i++)
{
for (int j = 1; j <= num[n]; j++)
{
if (ans[i][j] == 'X') {
cout << 'X';
}
else {
cout << ' ';
}
}
cout << endl;
}
cout << '-' << endl;
}
return 0;
}
边栏推荐
- Customize the web service configuration file
- 【统计学习方法】学习笔记——逻辑斯谛回归和最大熵模型
- The left-hand side of an assignment expression may not be an optional property access. ts(2779)
- [Q&A]AttributeError: module ‘signal‘ has no attribute ‘SIGALRM‘
- Epp+dis learning path (1) -- Hello world!
- ICLR 2022 | 基于对抗自注意力机制的预训练语言模型
- leetcode刷题:二叉树26(二叉搜索树中的插入操作)
- 2022危险化学品生产单位安全生产管理人员考题及在线模拟考试
- SQL head injection -- injection principle and essence
- Sorting, dichotomy
猜你喜欢
[deep learning] image multi label classification task, Baidu paddleclas
Vxlan static centralized gateway
[statistical learning method] learning notes - support vector machine (I)
About sqli lab less-15 using or instead of and parsing
聊聊Redis缓存4种集群方案、及优缺点对比
What if does not match your user account appears when submitting the code?
OSPF exercise Report
What is an esp/msr partition and how to create an esp/msr partition
Preorder, inorder and postorder traversal of binary tree
【统计学习方法】学习笔记——逻辑斯谛回归和最大熵模型
随机推荐
[statistical learning method] learning notes - support vector machine (Part 2)
Day-16 set
Realize a simple version of array by yourself from
Tutorial on the principle and application of database system (008) -- exercises on database related concepts
Niuke website
The hoisting of the upper cylinder of the steel containment of the world's first reactor "linglong-1" reactor building was successful
Solutions to cross domain problems
【从 0 开始学微服务】【01】什么是微服务
Learning and using vscode
How much does it cost to develop a small program mall?
[statistical learning methods] learning notes - Chapter 5: Decision Tree
MPLS experiment
RHSA first day operation
leetcode刷题:二叉树25(二叉搜索树的最近公共祖先)
【PyTorch实战】用RNN写诗
Decrypt gd32 MCU product family, how to choose the development board?
金融数据获取(三)当爬虫遇上要鼠标滚轮滚动才会刷新数据的网页(保姆级教程)
Processing strategy of message queue message loss and repeated message sending
Is it safe to open an account in Ping An Securities mobile bank?
SQL lab 21~25 summary (subsequent continuous update) (including secondary injection explanation)