rosetta-stone

x86 machine code (37 bytes) Hexdump: 6800B807BF8007BE8200B40EAC3C0D741338D8740A720481EF400181C7A000AB86C3EBE8C3 Run in MS-DOS with 50 line console, the input is taken from the command line. E.g. wave.com 1234567890qwertyuiopasdfghjklzxcvbnm Download binary here Update: Shaved off three bytes thanks to jrandomhacker

GolfScript – 41 (extra credit: 40) 1{.p`n+0:c:P;{:|P=c{c`P|:P!}if):c;}%~1}do {~.p`n+0:c:P;{:|P=c{c`P|:P!}if):c;}%1}do What? The procedure for getting the next number in the sequence: Convert the current number to a string, append a newline and loop over the characters. For each digit, if the previous digit P is the same, increment the counter c. Otherwise, add c and P to … Read more

Assembler, 165 bytes assembled Build Instructions Download A86 from here Add a reference to the A86 executable into your DOS search path Paste the code below into a text file (example: triforce.asm) Invoke the assembler: a86 triforce.asm This will create a .COM file called triforce.com Type triforce to run This was developed using the standard … Read more

Commodore 64 BASIC – 313 chars EDIT: See below for the golfed version A little trip down the memory lane with PET graphics, POKEs and PEEKs and everything 🙂 The program operates directly in the screen memory, so you just go ahead, clear the screen, place your dots, and type RUN: You have to wait … Read more

dc – 98 chars $ cat happyprimes [happy][sad]?dsI[[I~d*rd0<H+]dsHxd4<h]dshx[r]sr1=rP[ ][ non-]_1lI[1-d2>rdlIr%0<p]dspx-2=rP[prime]p $ echo 1 |dc happyprimes happy non-prime $ echo 139|dc happyprimes happy prime $ echo 2 |dc happyprimes sad prime $ echo 440|dc happyprimes happy non-prime $ echo 78 |dc happyprimes sad non-prime

C/C++, a dismal 945 characters… Takes input as parameters: a.out 5 52% #include<stdio.h> #include<memory.h> #include<stdlib.h> #define p printf int h,c,*l,i,w,j,*q,k;const char* z;int main(int argc,char**argv) {h=atoi(argv[1]);c=(h*h*atoi( argv[2])+99)/100;l=new int[ h*3];for(q=l,i=0,w=1;i<h; i++,c=(c-w)&~((c-w)>>31 ),w+=2)if(c>=w){*q++= 0;*q++ =0;* q++=w;} else {*q++=(c+1)/ 2;*q++=w-c;*q++ =c/2;}p(“_”); for(i=0;i<h ;i ++)p ( “__”);p (“\n” );q = l+h *3-1; for (i= –h;i>=0; i–){p(“%*” “s\\”,h-i,””) ; z= “x\0 … Read more

C – 741 621 600 characters (but handles the new cases properly) $ gcc water.c && ./a.out < test6.txt __ ___ / \xxxxx/ / _______ ________ / \ / _____/ \xxx/__ \xxxx\_ ____ / \xxxx/__/xxxxx/ \xxxxxxxx/ \xxxxxxxxx/ \xxxxxx\ /xxxx/ #include<stdio.h> char d[99][99],*p,*e,*z,*s=d,c,S=’ ‘,D=’-‘,O=’.’,U=’_’;n,w,x,N=99,i; g(y){for(i=0;!i;p+=N,e+=N){i=*p==D;for(z=p;z!=e;z+=y){if(*z!=O&&*z!= D)break;*z=*z==O?S:U;}}}f(char*n,int r){if(*n==O||*n==D){*n=r>0?’x’: S;int k;for(k=0;k<9;k++)f(n+k/3*N-N+k%3-1,r+k/3-1);}}main(){for(p=s; gets(p);p+=N,n++){x=strlen(p)-1;w=x>w?x:w;}for(p=s,e=d[N];p<s+N;p++) {for(i=1,z=p;z<e;z+=N)c=*z,c==0?*z=c=S:0,i?c==S?*z=O:c==U?*z=D:0:0,( c==”https://stackoverflow.com/”&&z[1]!=U)||(c==’\\’&&z[-1]!=D)||c==U?i=1-i:0;}p=s;e=s+w;g(1); p=s+w;e=s;g(-1);for(p=s;p<s+w;p++){for(z=p;*z==S;z+=N);f(z,1);}for(i =0;i<n;i++)printf(“%.*s\n”,w+1,d[i]);}