Conversation

Notices

1. Embed this notice
   Pleroma-tan (kirby@lab.nyanide.com)'s status on Friday, 02-Feb-2024 01:35:03 JST Pleroma-tan

   • 🥺
   @vee BOY you dont know obfuscated code yet cc @cutemaxxer PRODUCE THE WORST CODE ANYONE HAS EVER SEEN
   • Embed this notice
     🥺 (cutemaxxer@ryona.agency)'s status on Friday, 02-Feb-2024 01:41:10 JST 🥺

     in reply to
     @kirby @vee missed seeing this on your timeline?
     image.png
     Pleroma-tan likes this.
   • Embed this notice
     Pleroma-tan (kirby@lab.nyanide.com)'s status on Friday, 02-Feb-2024 01:44:45 JST Pleroma-tan

     in reply to

     • 🥺
     @cutemaxxer @vee NO I DID NOT OH MY GOD THAT CODE MAKES ME WANT TO DIE THANK YOU
   • Embed this notice
     🥺 (cutemaxxer@ryona.agency)'s status on Friday, 02-Feb-2024 02:16:26 JST 🥺

     in reply to

     @kirby @vee ah, have some more then :nigga3c:

     #include <stdint.h> #include <stdio.h> #define S "%s" #define _(x) x##ntf int main() { char*$=(char*)(uint64_t[]){ ~18417912228290092938ull, ~15780601667991084186ull, ~10420927750181526157ull}; _(pri)(S S S,$,8+$,16+$); }

     what about comparing integers without actually comparing them? (functionalmaxxing in C)

     int bitdigit(size_t i) { return i ? 1 + bitdigit(i >> 1) : 0; } size_t unit(size_t digits) { return digits ? (unit(digits - 1) << 1) | 1 : 0; } enum { COMPAR_BIGGER = -1, // x > y COMPAR_EQUAL, // x == y COMPAR_SMALLER, // x < y }; int compar(size_t x, size_t y) { const int dx = bitdigit(x); const int dy = bitdigit(y); return dx | dy ? dx ^ dy ? bitdigit(x | y) ^ dx ? COMPAR_SMALLER // : COMPAR_BIGGER : compar(x & unit(dx - 1), y & unit(dy - 1)) : COMPAR_EQUAL; }

     heres a neat program that prints out its arguments recursively, you should be able to read this at least

     #include <stdio.h> int main(int argc, char **argv) { return puts(*argv++), argc == 1 ? 0 : main(--argc, argv); }
     Pleroma-tan likes this.
     Pleroma-tan repeated this.
   • Embed this notice
     🥺 (cutemaxxer@ryona.agency)'s status on Friday, 02-Feb-2024 02:18:57 JST 🥺

     in reply to

     • 🥺
     @kirby @vee also i recommend you read https://people.eecs.berkeley.edu/~necula/cil/cil016.html, theres some wacky shit that pushes the boundaries of the C standard so you can never say C is easy again
     Pleroma-tan likes this.
   • Embed this notice
     Pleroma-tan (kirby@lab.nyanide.com)'s status on Friday, 02-Feb-2024 02:19:52 JST Pleroma-tan

     in reply to

     • 🥺
     @cutemaxxer @vee :abyss: