• 4 Posts
  • 64 Comments
Joined 10 months ago
cake
Cake day: March 3rd, 2024

help-circle











  • If anyone wants to actually run this, here ya go:

              #include              <stdio.h>
          short i=0;long          b[]={1712,6400
        ,3668,14961,00116,      13172,10368,41600,
      12764,9443,112,12544,15092,11219,116,8576,8832
    ,12764,9461,99,10823,17,15092,11219,99,6103,14915,
    69,1721,10190,12771,10065,16462,13172,10368,11776,
    14545,10460,10063,99,12544,14434,16401,16000,8654,
    12764,13680,10848,9204,113,10441,14306,9344,12404,
      32869,42996,12288,141129,12672,11234,87,10086,
        12655,99,22487,14434,79,10083,12750,10368,
          10086,14929,79,10868,14464,12357};long
            n=9147811012615426336;long main(){
              if(i<0230)printf("%c",(char)((
                0100&b[i++>>1]>>(i--&0x1)*
                  007)+((n>>(b[i>>001]>>
                    7*(0b1&01-i++)))&1
                      *main(111))));
                        return 69-
                          0b0110
                            ;}
    

    Bonus points if you can deobfuscate it!