60 条题解

  • -5
    @ 2026-5-16 17:03:51
    #include <iostream>
    #define L11010010011010111000101101011101 using
    #define L00101101100111001011101001101110 namespace
    #define L10110100111000101101001110001101 std
    #define L01011011001011100110110100111000 int
    #define L11100101101001101011001011100100 main
    #define L00111010110011010011101011001011 cout
    #define L10011100101101100111001010110110 char
    #define L01100110101110001011011001011100 endl
    #define L11001011100011011010011010111001 return
    L11010010011010111000101101011101 L00101101100111001011101001101110 L10110100111000101101001110001101;
    L01011011001011100110110100111000 L11100101101001101011001011100100(){
    L00111010110011010011101011001011<<(L10011100101101100111001010110110)104;
    L00111010110011010011101011001011<<(L10011100101101100111001010110110)101;
    L00111010110011010011101011001011<<(L10011100101101100111001010110110)108;
    L00111010110011010011101011001011<<(L10011100101101100111001010110110)108;
    L00111010110011010011101011001011<<(L10011100101101100111001010110110)111;
    L00111010110011010011101011001011<<(L10011100101101100111001010110110)32;
    L00111010110011010011101011001011<<(L10011100101101100111001010110110)119;
    L00111010110011010011101011001011<<(L10011100101101100111001010110110)111;
    L00111010110011010011101011001011<<(L10011100101101100111001010110110)114;
    L00111010110011010011101011001011<<(L10011100101101100111001010110110)108;
    L00111010110011010011101011001011<<(L10011100101101100111001010110110)100;
    L00111010110011010011101011001011<<L01100110101110001011011001011100;
    L11001011100011011010011010111001 0;
    }
    
    • @ 2026-5-23 16:50:20

      666

    • @ 2026-6-12 20:53:29

      刘夫妻小子正在和刘琪先生闹矛盾🤬刘夫妻小子最近在播报播课上说了这个🤔你和其他的六十七孩子有矛盾吗👹是的😨你有吗😅你认为谁是六七真的的代表😷mr六七还是六十七kid😱

      #include <iostream>
      #include <cstring>
      #include <cstdio>
      
      #define XOR_KEY 0x13
      #define MAGIC_NUM 42
      #define BUF_SIZE 256
      
      using namespace std;
      
      typedef unsigned char u8;
      typedef unsigned int u32;
      
      u8 magic_table[256];
      u32 seed = 12345;
      
      u32 lcg() {
          seed = seed * 1103515245 + 12345;
          return seed;
      }
      
      void init_table() {
          for (int i = 0; i < 256; i++) {
              magic_table[i] = (u8)(i ^ XOR_KEY ^ ((i * MAGIC_NUM) & 0xFF));
          }
      }
      
      u8 obfuscate(u8 c, int idx) {
          return magic_table[(c + idx * MAGIC_NUM) & 0xFF];
      }
      
      u8 deobfuscate(u8 c, int idx) {
          for (int i = 0; i < 256; i++) {
              if (obfuscate((u8)i, idx) == c) {
                  return (u8)i;
              }
          }
          return 0;
      }
      
      void recursive_print(u8 *arr, int len, int idx) {
          if (idx >= len) {
              return;
          }
          u8 ch = deobfuscate(arr[idx], idx);
          cout << (char)ch;
          recursive_print(arr, len, idx + 1);
      }
      
      int do_nothing(int a, int b, int c) {
          return (a + b - c) * (a % 2 + b % 3 + c % 7);
      }
      
      int main() {
          init_table();
      
          u8 raw_data[] = {
              obfuscate('h', 0), obfuscate('e', 1), obfuscate('l', 2),
              obfuscate('l', 3), obfuscate('o', 4), obfuscate(' ', 5),
              obfuscate('w', 6), obfuscate('o', 7), obfuscate('r', 8),
              obfuscate('l', 9), obfuscate('d', 10), obfuscate('\n', 11)
          };
      
          int dummy1 = do_nothing(1, 2, 3);
          int dummy2 = do_nothing(10, 20, 30);
          char buffer[BUF_SIZE];
          memset(buffer, 0, BUF_SIZE);
          memcpy(buffer, raw_data, sizeof(raw_data));
      
          for (int i = 0; i < 5; i++) {
              dummy1 += lcg() % 100;
              dummy2 -= lcg() % 50;
          }
      
          recursive_print((u8*)buffer, sizeof(raw_data), 0);
      
          if (dummy1 > dummy2) {
              return 0;
          } else {
              return 0;
          }
      }
      

信息

ID
115
时间
1000ms
内存
32MiB
难度
7
标签
递交数
2018
已通过
494
上传者