https://kamilborys.com
•
This is a web feed, also known as an Atom feed. Subscribe by copying the URL from the address bar into your newsreader. Visit About Feeds to learn more and get started. It's free.Visit websiteRecent postsUpdated on $DATEdarkdateCKamilCase - CZola2021-09-06T00:00:00+00:00https://kamilborys.com/tags/c/atom.xmlLet the music play2021-09-06T00:00:00+00:002021-09-06T00:00:00+00:00Kamil Boryshttps://kamilborys.com/blog/let-the-music-play/char a;float b,c;main(d){for(;d>2e3*c?c=1,scanf(" %c%f",&a,&c),d=55-a%32*9/5,
b=d>9,d=d%13-a/32*12:1;a=2)++d<24?b*=89/84.:putchar(a=b*d);}
Good news for all International Obfuscated C Code Contest fans -- here's another winning piece from 2013 written by Yusuke Endoh, who is no stranger to the Contest. It is dubbed the Most Tweetable 1-Liner, because is small enough to fit in a tweet (137 characters only), yet can "tweet out a tune", that is, will play some music for your entertainment…Have fun with Unix2018-03-01T08:09:54+00:002018-03-01T08:09:54+00:00Kamil Boryshttps://kamilborys.com/blog/have-fun-with-unix/main() { printf(&unix["\021%six\012\0"],(unix)["have"]+"fun"-0x60);}
Just one line of code, but lots of confusion. What does this program do?…How to dismantle a compiler bomb2018-01-20T16:52:25+00:002018-01-20T16:52:25+00:00Kamil Boryshttps://kamilborys.com/blog/how-dismantle-compiler-bomb/main[-1u]={1};
You have heard of "zip bombs" (a tiny ZIP file that decompresses to multiple gigabytes) and "XML bombs" (small XML file abusing the entities to consume lots of memory), and now there is a "compiler bomb" to follow suit. The idea is quite similar -- the source code is only 14 bytes, but the generated executable will be over 16 GB in size…Namaste India2017-10-25T20:10:09+00:002017-10-25T20:10:09+00:00Kamil Boryshttps://kamilborys.com/blog/namaste-india/This obfuscated piece of C code prints the map of India to the standard output.
#include <stdio.h>
main()
{
int a,b,c;
int count = 1;
for (b=c=10;a="- FIGURE?, UMKC,XYZHello Folks,\
TFy!QJu ROo TNn(ROo)SLq SLq ULo+\
UHs UJq TNn*RPn/QPbEWS_JSWQAIJO^\
NBELPeHBFHT}TnALVlBLOFAkHFOuFETp\
HCStHAUFAgcEAelclcn^r^r\\tZvYxXy\
T|S~Pn SPm SOn TNn ULo0ULo#ULo-W\
Hq!WFs XDt!" [b+++21]; )
for(; a-- > 64 ; )
putchar ( ++c=='Z' ? c = c/ 9:33^b&1);
return 0;
}
…Quine - a self-replicating program2017-09-11T17:37:39+00:002017-09-11T17:37:39+00:00Kamil Boryshttps://kamilborys.com/blog/quine-a-self-replicating-program/Quines are computer programs that accept no input and write its own source code on the standard output. This entry was taken from the Jargon File, the author is unknown.
char*f="char*f=%c%s%c;main()
{printf(f,34,f,34,10);}%c";
main(){printf(f,34,f,34,10);}
…Underscore Pi2017-08-27T12:19:38+00:002017-08-27T12:19:38+00:00Kamil Boryshttps://kamilborys.com/blog/underscore-pi/This clever program written by Brian Westley calculates π by looking at its own area. It is one of the winning entries of IOCCC in 1988.
#define _ -F<00||--F-OO--;
int F=00,OO=00;main(){F_OO();printf("%1.3f\n",4.*-F/OO/OO);}F_OO()
{
_-_-_-_
_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_
_-_-_-_
}
…Duff's device2017-08-24T18:14:43+00:002017-08-24T18:14:43+00:00Kamil Boryshttps://kamilborys.com/blog/duffs-device/
"This code forms some sort of argument (...), but I'm not sure whether it's for or against."
send(to, from, count)
register short *to, *from;
register count;
{
register n = (count + 7) / 8;
switch (count % 8) {
case 0: do { *to = *from++;
case 7: *to = *from++;
case 6: *to = *from++;
case 5: *to = *from++;
case 4: *to = *from++;
case 3: *to = *from++;
case 2: *to = *from++;
case 1: *to = *from++;
} while (--n > 0);
}
}
…