reverse_re3-入土为安的第十天

简介: reverse_re3-入土为安的第十天

一个迷宫题

shirt+f12发现flag字样

点进去发现迷宫

675 应该是3 * 15*15

即有三个迷宫

shift+e提取

import numpy as np
# 你的数据(长度应为 225 的倍数)
dword_202020 = [
    1,
    1,
    1,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    1,
    1,
    1,
    1,
    0,
    3,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    1,
    1,
    1,
    1,
    0,
    0,
    0,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    1,
    1,
    1,
    1,
    0,
    0,
    0,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    1,
    1,
    1,
    1,
    0,
    0,
    0,
    1,
    1,
    1,
    1,
    1,
    0,
    0,
    1,
    1,
    1,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    0,
    0,
    1,
    1,
    1,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    0,
    0,
    1,
    1,
    1,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    1,
    0,
    1,
    1,
    1,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    0,
    1,
    1,
    1,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    4,
    0,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    1,
    0,
    3,
    1,
    1,
    1,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    1,
    0,
    1,
    1,
    0,
    0,
    0,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    1,
    0,
    1,
    1,
    0,
    0,
    0,
    1,
    1,
    1,
    1,
    1,
    0,
    0,
    1,
    1,
    0,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    0,
    0,
    1,
    1,
    0,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    0,
    0,
    1,
    1,
    0,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    1,
    1,
    1,
    1,
    0,
    1,
    1,
    0,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    1,
    0,
    0,
    1,
    0,
    1,
    1,
    0,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    1,
    0,
    0,
    0,
    0,
    1,
    1,
    0,
    1,
    1,
    1,
    1,
    1,
    1,
    0,
    1,
    0,
    1,
    1,
    0,
    1,
    1,
    0,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    0,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    4,
    0,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    3,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    0,
    1,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    1,
    1,
    0,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    0,
    0,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    1,
    0,
    1,
    0,
    0,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    1,
    1,
    0,
    0,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    1,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    1,
    1,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    1,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    0,
    4,
    0
]
# 矩阵的大小
n = 15
matrix_size = n * n
# 检查数组长度
length = len(dword_202020)
# 如果数据长度不足,填充到最近的矩阵大小的整数倍
if length < matrix_size:
    print(f"数据长度不足 ({length}), 将数据填充至 {matrix_size}")
    dword_202020 = dword_202020 + [0] * (matrix_size - length)  # 用 0 填充到最近的矩阵大小
elif length % matrix_size != 0:
    # 如果数据长度超过要求,截取到最近的矩阵大小的整数倍
    new_length = (length // matrix_size) * matrix_size
    print(f"数据长度超过 ({length}), 截取至 {new_length}")
    dword_202020 = dword_202020[:new_length]
# 转换为 numpy 数组
array = np.array(dword_202020)
# 计算每个矩阵的起始索引
matrices = [array[i:i + matrix_size].reshape(n, n) for i in range(0, len(array), matrix_size)]
# 打印矩阵
for idx, mat in enumerate(matrices):
    print(f"Matrix {idx + 1}:\n{mat}\n")

输出:

Matrix 1:

[[1 1 1 1 1 0 0 0 0 0 0 0 0 0 0]

[1 1 1 1 1 0 3 1 1 0 0 0 0 0 0]

[1 1 1 1 1 0 0 0 1 0 0 0 0 0 0]

[1 1 1 1 1 0 0 0 1 0 0 0 0 0 0]

[1 1 1 1 1 0 0 0 1 1 1 1 1 0 0]

[1 1 1 1 1 0 0 0 0 0 0 0 1 0 0]

[1 1 1 1 1 0 0 0 0 0 0 0 1 0 0]

[1 1 1 1 1 0 0 0 0 0 0 0 1 1 0]

[1 1 1 1 1 0 0 0 0 0 0 0 0 1 0]

[1 1 1 1 1 0 0 0 0 0 0 0 0 4 0]

[1 1 1 1 1 1 1 1 1 1 1 1 1 1 1]

[1 1 1 1 1 1 1 1 1 1 1 1 1 1 1]

[1 1 1 1 1 1 1 1 1 1 1 1 1 1 1]

[1 1 1 1 1 1 1 1 1 1 1 1 1 1 1]

[1 1 1 1 1 1 1 1 1 1 1 1 1 1 1]]

Matrix 2:

[[1 1 0 0 0 0 0 0 0 0 0 0 0 0 0]

[1 1 0 3 1 1 1 1 1 0 0 0 0 0 0]

[1 1 0 1 1 0 0 0 1 0 0 0 0 0 0]

[1 1 0 0 0 0 0 0 1 0 0 0 0 0 0]

[1 1 0 1 1 0 0 0 1 1 1 1 1 0 0]

[1 1 0 1 1 0 0 0 0 0 0 0 1 0 0]

[1 1 0 1 1 0 0 0 0 0 0 0 1 0 0]

[1 1 0 1 1 0 0 0 0 0 1 1 1 1 0]

[1 1 0 1 1 0 0 0 0 0 1 0 0 1 0]

[1 1 0 1 1 0 0 0 0 0 1 0 0 0 0]

[1 1 0 1 1 1 1 1 1 0 1 0 1 1 0]

[1 1 0 1 1 1 1 1 1 1 1 1 1 1 0]

[1 1 0 0 0 0 0 0 0 0 0 0 0 4 0]

[1 1 1 1 1 1 1 1 1 1 1 1 1 1 1]

[1 1 1 1 1 1 1 1 1 1 1 1 1 1 1]]

Matrix 3:

[[0 0 0 0 0 0 0 0 0 0 0 0 0 0 0]

[0 3 1 1 0 0 0 0 0 0 0 0 0 0 0]

[0 0 0 1 0 1 1 1 0 0 0 0 0 0 0]

[0 0 0 1 1 1 0 1 0 0 0 0 0 0 0]

[0 0 0 0 1 0 0 1 0 0 0 0 0 0 0]

[0 1 1 0 1 0 0 1 0 0 0 0 0 0 0]

[0 0 1 1 1 0 0 1 0 0 0 0 0 0 0]

[0 0 0 0 0 0 0 1 0 0 0 0 0 0 0]

[0 0 0 0 0 0 0 1 1 1 1 0 0 0 0]

[0 0 0 0 0 0 0 0 0 0 1 0 0 0 0]

[0 0 0 0 0 0 0 0 0 0 1 0 0 0 0]

[0 0 0 0 0 0 0 0 0 0 1 0 0 0 0]

[0 0 0 0 0 0 0 0 0 0 1 1 1 1 0]

[0 0 0 0 0 0 0 0 0 0 0 0 0 1 0]

[0 0 0 0 0 0 0 0 0 0 0 0 0 4 0]]

3是起点,4是终点

上 下 左 右 wsad

ddsssddddsssdssdddddsssddddsssaassssdddsddssddwddssssssdddssssdddss

32小位

aeea66fcac7fa80ed8f79f38ad5bb953

目录
相关文章
|
JavaScript 前端开发 搜索推荐
不好意思!🍎我真的只会用 Array.prototype.sort() 写✍排序!
不好意思!🍎我真的只会用 Array.prototype.sort() 写✍排序!
86 0
|
存储 安全 C语言
reverse1题解
reverse1题解
98 0
reverse1题解
|
存储 安全 Unix
reverse2题解
reverse2题解
103 0
reverse2题解
|
存储 数据安全/隐私保护 Python
reverse3题解
reverse3题解
140 0
reverse3题解
|
C++
旋转数组STL(reverse)
题目: 给定一个数组,将数组向右移动k步,其中k为非负数。 样例:
89 0
[HDU7073] Integers Have Friends 2.0 -随机大法好
题意: 找到最大的一个集合,使得集合内所有元素 % m(>=2) 问最大的集合大小
108 0
[HDU7073] Integers Have Friends 2.0 -随机大法好
Biggest Number深搜
You can start from any square, walk in the maze, and finally stop at some square. Each step, you may only walk into one of the four neighbouring squares (up, down, left, right) and you cannot walk into obstacles or walk into a square more than once.
122 0
Biggest Number深搜
|
机器学习/深度学习
HDOJ 1061 Rightmost Digit(循环问题)
HDOJ 1061 Rightmost Digit(循环问题)
131 0
HDOJ 1061 Rightmost Digit(循环问题)
HDOJ(HDU) 2138 How many prime numbers(素数-快速筛选没用上、)
HDOJ(HDU) 2138 How many prime numbers(素数-快速筛选没用上、)
109 0