我独自一人用 C++ 写了一款 AI，对系统要求极低，代码已开源，效果媲美DeepSeek

[liaowen]

#include <iostream>
#include <string>
#define _ _114514(std:, :cout)
#define __ std::cin
#define ___ std::endl
#define __________ _114514(i, nt)
#define ___________ _114514(ma, in)
#define _114514(_____, ______) _____##______
__________ ___________() {std::string ____________________;_ << []() -> _114514(std:, :string) {std::string ______________________;int i = 0, j = 0;unsigned char _________________[4],_______________________________[3];for (const auto &c : "6K+36L6T5YWl6Zeu6aKY77ya") {if (c == '=') break;_________________[i++] = c;if (i == 4) {for (i = 0; i < 4; i++) {_________________[i] = _114514(std::str,ing)("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/").find(_________________[i]);}_______________________________[0] = (_________________[0] << 2) + ((_________________[1] & 0x30) >> 4);_______________________________[1] = ((_________________[1] & 0xf) << 4) + ((_________________[2] & 0x3c) >> 2);_______________________________[2] = ((_________________[2] & 0x3) << 6) + _________________[3];for (i = 0; i < 3; i++) {______________________ += _______________________________[i];}i = 0;}}if (i) {for (j = i; j < 4; j++) {_________________[j] = '\0';}for (j = 0; j < 4; j++) {_________________[j] = _114514(std::st,ring)("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/").find(_________________[j]);}_______________________________[0] = (_________________[0] << 2) + ((_________________[1] & 0x30) >> 4);_______________________________[1] = ((_________________[1] & 0xf) << 4) + ((_________________[2] & 0x3c) >> 2);_______________________________[2] = ((_________________[2] & 0x3) << 6) + _________________[3];for (j = 0; j < i - 1; j++) {______________________ += _______________________________[j];}}return ______________________;}();std::getline(__, ____________________);_ << []() -> _114514(std:, :string) {std::string ______________________;int i = 0, j = 0;unsigned char _________________[4],_______________________________[3];for (const auto &c : "5pyN5Yqh5Zmo57mB5b+Z77yM6K+356iN5YCZ5YaN6K+V") {if (c == '=') break;_________________[i++] = c;if (i == 4) {for (i = 0; i < 4; i++) {_________________[i] = _114514(std::str,ing)("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/").find(_________________[i]);}_______________________________[0] = (_________________[0] << 2) + ((_________________[1] & 0x30) >> 4);_______________________________[1] = ((_________________[1] & 0xf) << 4) + ((_________________[2] & 0x3c) >> 2);_______________________________[2] = ((_________________[2] & 0x3) << 6) + _________________[3];for (i = 0; i < 3; i++) {______________________ += _______________________________[i];}i = 0;}}if (i) {for (j = i; j < 4; j++) {_________________[j] = '\0';}for (j = 0; j < 4; j++) {_________________[j] = _114514(std::st,ring)("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/").find(_________________[j]);}_______________________________[0] = (_________________[0] << 2) + ((_________________[1] & 0x30) >> 4);_______________________________[1] = ((_________________[1] & 0xf) << 4) + ((_________________[2] & 0x3c) >> 2);_______________________________[2] = ((_________________[2] & 0x3) << 6) + _________________[3];for (j = 0; j < i - 1; j++) {______________________ += _______________________________[j];}}return ______________________;}() << ___;return 0;}

[POiSON_GiRL_FRiEND (毒女友)]

linuxdo macro之神

[liaowen]

还有 Lambda

[elfmaid (Elf)]

怎么又是这种

[wawu (竹屋)]

迟早有个合订本帖子

[NaiveMagic]

对吗

[liaowen]

不是
请输入问题：114514
服务器繁忙，请稍候再试

[hanlinwenyuan (翰林文苑)]

看到标题就知道是啥了。

[happyZYM]

这是什么模型

[NaiveMagic]

腾讯云的 r1

[handsome (大帅哥)]

还是你会！

[happyZYM]

谢谢！我去看看

[wwow (樱悦)]

佬友好厉害

[6512345 (65)]

病友 突然想起这个