Suggestions
Hi, Great list! You can find a list of all our tiny JS projects here: https://gist.github.com/xem/206db44adbdd09bac424 Feel free to cite any of them (or not) in your collection. Cheers, The codegolf team
also: https://github.com/mame/quine-relay
Many many thanks for your suggestion. I will certainly browse through them. :)
:+1:
I used to play around with RLE stuff, so I created the beneath code and have saved it as pipe.c, but it's obvious that this isn't a pipe (Ce n'est pas une pipe).
Feel free to add this to your collection.
#include <stdio.h>
#define J(x) "+=:~,*"[x]
#define P 255
#define Q ((P)-1)
int main(void) {
int i=0,j=0,c,l;char d[297];const char *u=
" bool is_pipe(void) { *+* return false; *+* } *+*+\0\x1b[01m\0\x1b[00m";
const unsigned char n[]={253,79,P,10,Q,68,P,1,2,1,2,4,1,3,1,1,Q,37,P,9,1,2,Q,12,
P,2,1,2,2,4,1,1,6,Q,29,P,1,3,14,3,Q,11,P,2,1,2,2,7,5,1,Q,24,P,3,1,3,1,2,2,6,1,1,
2,2,Q,12,P,2,1,2,2,7,5,1,Q,21,P,1,1,1,3,1,1,2,3,1,1,Q,24,P,1,1,3,2,7,5,1,Q,19,P,
2,1,3,1,3,1,2,Q,27,P,1,2,3,2,7,5,1,Q,17,P,1,1,4,1,2,2,2,Q,29,P,1,1,1,3,2,6,6,1,
Q,14,P,2,1,4,1,6,Q,31,P,1,1,1,3,2,6,6,1,Q,12,P,2,2,2,1,4,1,2,Q,34,P,1,1,3,2,6,6,
1,Q,10,P,2,2,2,1,3,4,1,Q,35,P,2,1,2,2,6,6,1,Q,8,P,2,3,2,1,2,5,Q,37,P,2,1,2,2,6,
6,1,Q,5,P,2,3,2,2,2,5,1,Q,38,P,2,5,6,7,4,3,3,2,2,6,Q,40,P,3,4,5,8,5,2,2,3,6,1,Q,
42,P,2,4,5,7,1,6,4,7,Q,44,P,10,10,4,9,1,Q,47,P,7,24,1,Q,49,P,1,27,Q,54,P,6,1,2,
1,13,1,Q,58,P,1,17,1,Q,14,24,28,P,1,4,1,1,1,Q,20,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
1,1,1,1,1,1,1,1,1,56,1,5,1,1,1,1,1,1,1,1,1,1,1,1,1,4,1,56,1,1,1,20,1,56,24,89,Q,
},a[]={0,16,16,50,49,1,48,35,32,49,1,50,50,3,35,32,49,1,50,16,33,1,50,66,19,32,
49,1,50,48,50,48,19,36,36,3,16,19,35,2,16,50,66,1,48,19,35,3,16,50,66,1,49,1,50,
48,49,1,32,19,16,19,35,3,16,19,66,3,16,19,35,3,16,19,33,3,16,19,35,3,16,19,32,
49,1,50,48,49,1,50,48,49,50,49,1,50,3,19,33,1,50,48,49,50,49,50,3,35,35,3,33,3,
32,36,36,35,3,33,5,3,35,35,5,P,};
for(;a[i]!=P;i++){d[j++]=J(a[i]>>4);d[j++]=J(a[i]&15);}
for(i=0;u[i];i++)d[j++]=u[i];
for(i=c=l=0;i<(int)(sizeof(n)/sizeof(*(n)))&&c<(int)(sizeof(d));i++){
if(n[i]>=Q){fputs(u+51+(n[i]!=P?6:0),stdout);continue;}
for(j=0;j<n[i];j++){putchar(d[c]);if(!(++l%80))putchar('\n');}c++;}
return 0; // by mar77i, all rights and warranties disclaimed
}
I wanted to suggest the Haskell code which prints Ruby script which prints Python script which prints initial Haskell code... but then I looked into quine-relay above...
Nevertheless, here it is, I don't remember where I found it:
q a b c=putStrLn $ b ++ [toEnum 10,'q','(']
++ show b ++ [','] ++ show c ++ [','] ++ show a ++ [')']
main=q "q a b c=putStrLn $ b ++ [toEnum 10,'q','('] ++ show b ++ [','] ++ show c ++ [','] ++ show a ++ [')']"
"def q(a,b,c):print b+chr(10)+'q('+repr(b)+','+repr(c)+','+repr(a)+')'"
"def e(x) return 34.chr+x+34.chr end;def q(a,b,c) print b+10.chr+'main=q '+e(b)+' '+e(c)+' '+e(a)+' '+10.chr end"
Calculate Easter date in Excel:
http://www.contextures.com/exceleastercalculation.html
The winner was apparently Norbert Hetterich of Germany with this formula (assumes the year is in cell A1, and day/month/year date format in regional settings)
=FLOOR(DAY(MINUTE(A1/38)/2+56)&"/5/"&A1,7)-34
a stack machine based only on the word chicken http://torso.me/chicken
I know its not common practice to do this, but just wanted to say thank for such a cool repository. Found it when coming across your https://downgit.github.io/#/home?url=https:%2F%2Fgithub.com%2Fpnp%2Fsp-dev-fx-webparts%2Ftree%2Fmain%2Fsamples%2Freact-custompropertypanecontrols tool.