下载附件,运行一下
丢进IDA看伪代码
__int64 __fastcall main(int a1, char **a2, char **a3)
{
__int64 v3; // rbx
int v4; // eax
char v5; // bp
char v6; // al
const char *v7; // rdi
unsigned int v9; // [rsp+0h] [rbp-28h] BYREF
int v10[9]; // [rsp+4h] [rbp-24h] BYREF
v10[0] = 0;
v9 = 0;
puts("Input flag:");
scanf("%s", &s1);
if ( strlen(&s1) != 24 || strncmp(&s1, "nctf{", 5uLL) || *(&byte_6010BF + 24) != 125 )
{
LABEL_22:
puts("Wrong flag!");
exit(-1);
}
v3 = 5LL;
if ( strlen(&s1) - 1 > 5 )
{
while ( 1 )
{
v4 = *(&s1 + v3);
v5 = 0;
if ( v4 > 78 )
{
if ( (unsigned __int8)v4 == 79 )
{
v6 = sub_400650(v10);
goto LABEL_14;
}
if ( (unsigned __int8)v4 == 111 )
{
v6 = sub_400660(v10);
goto LABEL_14;
}
}
else
{
if ( (unsigned __int8)v4 == 46 )
{
v6 = sub_400670(&v9);
goto LABEL_14;
}
if ( (unsigned __int8)v4 == 48 )
{
v6 = sub_400680(&v9);
LABEL_14:
v5 = v6;
goto LABEL_15;
}
}
LABEL_15:
if ( !(unsigned __int8)sub_400690(asc_601060, (unsigned int)v10[0], v9) )
goto LABEL_22;
if ( ++v3 >= strlen(&s1) - 1 )
{
if ( v5 )
break;
LABEL_20:
v7 = "Wrong flag!";
goto LABEL_21;
}
}
}
if ( asc_601060[8 * v9 + v10[0]] != 35 )
goto LABEL_20;
v7 = "Congratulations!";
LABEL_21:
puts(v7);
return 0LL;
}
翻译一下
再跳转过去看一下游戏地图
更具前面的信息,这是一个8*8的矩阵,复制出来重新排版一下
******
* * *
*** * **
** * **
* *# *
** *** *
** *
********
不过其实在内存中这个地图不长那样,而是下面这样(用python脚本得到一个转置的地图)
import numpy as np
game_map = ' ******* * **** * **** * *** *# *** *** *** *********'
game_map = game_map.replace(' ', '□').replace('*', '■').replace('#', '◉')
maps = []
for ci, c in enumerate(game_map):
if ci % 8 == 0:
maps.append([])
maps[-1].append(c)
maps = np.array(maps)
print(maps.T)
最后0,0开始走到#的位置就可以了(这是什么反向迷宫吗?)
迷宫顺序,⬇️➡️⬇️⬇️➡️➡️⬆️➡️➡️➡️⬇️⬇️⬇️⬇️⬅️⬅️⬆️⬆️
翻译过来就是:nctf{o0oo00O000oooo..OO}