试试看你能不能不能直接破解，或者给出超越ai的破解算法
密文：
"616266761 3688090514 2051484786 3246711912 2988375975 3978531149 3942818114 4029465945 2293174723 1735903907 1387933565 2487997818 2801405496 1779258259 2039618578 3477470990 2767467200 859956385 3679211147 456933634"
加密算法：

"int main() { UINT32 outputString[100] = {0}; StringToUINT32Array(g_testString, outputString, 100); for (size_t i = 0; i < sizeof(outputString); i++) { if (outputString[i] == 0) { break; } g_testKey1 = SimpleLinearCongruentialMapping(g_testKey1); g_testKey2 = SimpleLinearCongruentialMapping(g_testKey2); if (g_testKey1 % 4 == 0) { g_testKey2 = SimpleLinearCongruentialMapping(g_testKey2); } if (g_testKey2 % 4 == 0) { g_testKey1 = SimpleLinearCongruentialMapping(g_testKey1); } UINT64 dynamicKey = (g_testKey1 >> 8) ^ ((g_testKey2 >> 8) << 8); outputString[i] ^= dynamicKey; printf("%u ", outputString[i]); } return 0;}UINT64 SimpleLinearCongruentialMapping(UINT64 num) { num = (num * 0x1010101 + 0xB3B3B3B3) % ((UINT64)UINT32_MAX + 1); return num;}"
贴吧上看可能有点难受，可以复制到编辑器里。