进去就是很明显的maze题
直接就看check吧
__int64 __fastcall check(const char *a1)
{
int v1; // eax
int v3; // [rsp+20h] [rbp-10h]
int x; // [rsp+24h] [rbp-Ch]
int y; // [rsp+28h] [rbp-8h]
int i; // [rsp+2Ch] [rbp-4h]
v3 = strlen(a1);
y = 15;
x = 1;
for ( i = 0; i < v3; ++i )
{
v1 = a1[i];
if ( v1 == 'd' )
{
++x;
}
else if ( v1 > 'd' )
{
if ( v1 == 's' )
{
++y;
}
else
{
if ( v1 != 'w' )
return 0i64;
--y;
}
}
else
{
if ( v1 != 'a' )
return 0i64;
--x;
}
if ( map[16 * y + x] )
return 0i64;
}
return 1i64;
}
动调下断点 maze一下也有了
1111111111111111
1000001111110111
1011101111110111
1011101100010111
1011101101010111
1011100001010111
1011111101010111
1011111100010111
1011111110110111
1011111110110111
1000011000010001
1111011110110101
1111011110110101
1000011110110100
1011111110000111
1011111111111111
这是地图,我们看一下就知道是1-15 到 15-13
路径在md5就ok
import hashlib
flag='wwdddwwwaaawwwwwwwwwddddssssdddssdsssssssdddwwwwddsssd'
x = hashlib.md5(flag.encode("utf8"))#md5和类似的,就讲sha1更换就行
y = x.hexdigest()
print(y)
下班!