it's too long for me to include everything, just try it yourself
image.png
Notices by 🥺 (cutemaxxer@ryona.agency)
-
Embed this notice
🥺 (cutemaxxer@ryona.agency)'s status on Saturday, 03-Feb-2024 13:09:24 JST 
🥺
image.png -
Embed this notice
🥺 (cutemaxxer@ryona.agency)'s status on Saturday, 03-Feb-2024 13:02:36 JST
🥺
hey @kirby try compiling this with g++ and witness the mountain cascade of compiler errors
```
#include <map>
#include <algorithm>
template<class T,class U>void f(T,U u){std::vectorv;auto i=end(v);find(i,i,u);find(i,i,&u);U*p,**q,r(),s(U);find(i,i,&p);find(i,i,&q);find(i,i,r);find(i,i,&r);find(i,i,s);find(i,i,&s);}template<class T>void f(T t){f(t,0);f(t,0l);f(t,0u);f(t,0ul);f(t,0ll);f(t,.0);f(t,.0l);f(t,.0f);f(t,' ');f(t,L' ');f(t,u' ');f(t,U' ');f(t,"");f(t,L"");}int main(){f(0);f(0l);f(0u);f(0ul);f(0ll);f(.0);f(.0l);f(.0f);f(' ');f(L' ');f(u' ');f(U' ');f("");f(L"");f(u"");f(U"");}
``` -
Embed this notice
🥺 (cutemaxxer@ryona.agency)'s status on Saturday, 03-Feb-2024 12:58:45 JST
🥺
what woukd :softcandy: be :weirdfroth: -
Embed this notice
🥺 (cutemaxxer@ryona.agency)'s status on Saturday, 03-Feb-2024 02:24:09 JST
🥺
@i @khayyam cc @RustyCrab @binkle
@cassidyclown :niggahardcandy: #niggapullrequest :niggahardcandy: #hardcandypullrequest :niggahardcandy: -
Embed this notice
🥺 (cutemaxxer@ryona.agency)'s status on Friday, 02-Feb-2024 02:18:57 JST
🥺
@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 -
Embed this notice
🥺 (cutemaxxer@ryona.agency)'s status on Friday, 02-Feb-2024 02:16:26 JST
🥺
@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); } -
Embed this notice
🥺 (cutemaxxer@ryona.agency)'s status on Friday, 02-Feb-2024 01:49:59 JST
🥺
now im afraid people are gonna think i only write whitney-style :niggainsane: pseudoobfuscated code -
Embed this notice
🥺 (cutemaxxer@ryona.agency)'s status on Friday, 02-Feb-2024 01:41:10 JST
🥺
@kirby @vee missed seeing this on your timeline?
image.png -
Embed this notice
🥺 (cutemaxxer@ryona.agency)'s status on Wednesday, 31-Jan-2024 22:25:11 JST
🥺
@kirby its pure autism please dont -
Embed this notice
🥺 (cutemaxxer@ryona.agency)'s status on Wednesday, 31-Jan-2024 00:14:59 JST
🥺
@kirby yggdrasil.social -
Embed this notice
🥺 (cutemaxxer@ryona.agency)'s status on Tuesday, 30-Jan-2024 00:09:01 JST
🥺
@kirby then did you think programs store the entered password in some special form? -
Embed this notice
🥺 (cutemaxxer@ryona.agency)'s status on Sunday, 28-Jan-2024 23:26:24 JST
🥺
kirby please -
Embed this notice
🥺 (cutemaxxer@ryona.agency)'s status on Sunday, 28-Jan-2024 23:16:09 JST
🥺
bekonit raped herself🥀 -
Embed this notice
🥺 (cutemaxxer@ryona.agency)'s status on Sunday, 28-Jan-2024 23:13:36 JST
🥺
i always try to watch watamote and i cringe so hard 3 minutes in how do you niggas think it's "literally you", she's at a legally retarded level -
Embed this notice
🥺 (cutemaxxer@ryona.agency)'s status on Sunday, 28-Jan-2024 23:13:23 JST
🥺
@kirby wut :niggaloved:
All GNU social JP content and data are available under the 
