【逆向分析】BUUCTF 逆向题目 简单注册器

https://buuoj.cn/challenges#%E7%AE%80%E5%8D%95%E6%B3%A8%E5%86%8C%E5%99%A8

https://files.buuoj.cn/files/a98b3e85a645cab1abb3e16d5551f268/e55393cc-a3cb-493a-a138-1eb94f781845.zip

#include<stdio.h>#include<string.h>
int main(){    char arr_c[] = "dd2940c04462b4dd7c450528835cca15";    arr_c[2] = (char)(arr_c[2] + arr_c[3] - 50);    arr_c[4] = (char)(arr_c[2] + arr_c[5] - 48);    arr_c[30] = (char)(arr_c[0x1F] + arr_c[9] - 48);    arr_c[14] = (char)(arr_c[27] + arr_c[28] - 97);    for(int i = 0; i < 16; ++i) {        char a = arr_c[31 - i];        arr_c[31 - i] = arr_c[i];        arr_c[i] = a;            }        puts(arr_c);        return 0;}

flag{59acc538825054c7de4b26440c0999dd}