Just for fun I thought I’d knock it up. It ended up being trickier than I thought because I went in not fully understanding how the boundary part works, eventually I worked out that the starting and ending ‘–‘ were significant and off it went. <?php if(isset($_POST[‘submit’])) { //The form has been submitted, prep a … Read more
11 bytes in J: C=:0{]/:|@- Examples: >> a =: 1 3 8 10 13 >> 4 C a 3 >> 11 C a 10 >> 12 C a 13 my breakdown for the layman: 0{ First element of ] the right argument /: sorted by | absolute value @ of – subtraction
Crazy Python solution – 79 characters max([b[x] for x in range(9) for y in range(x) for z in range(y) if x+y+z==12 and b[x]==b[y]==b[z]] + [0]) However, this assumes a different order for the board positions in b: 5 | 0 | 7 —+—+— 6 | 4 | 2 —+—+— 1 | 8 | 3 That … Read more
Mathematica – 179 163 154 151 chars a = {2, 2, 2}; s = Export[“out.txt”, CellularAutomaton[{224, {2, {a, {2, 1, 2}, a}}, {1,1}}, (ReadList[#1, Byte, RecordLists → 2>1] – 46)/ 42, #2]〚#2〛 /. {0 → “.”, 1 → “X”}, “Table”] & Spaces added for readability Invoke with s[“c:\life.txt”, 100] Animation: You can also get a … Read more
Easiest to just use a Counter >>> from collections import Counter >>> a = dict(a=1,b=2 ) >>> b = dict( b=3,c=2) >>> Counter(a)+Counter(b) Counter({‘b’: 5, ‘c’: 2, ‘a’: 1}) >>> dict(Counter({‘b’: 5, ‘c’: 2, ‘a’: 1})) {‘a’: 1, ‘c’: 2, ‘b’: 5}
LabVIEW 51 nodes, 5 structures, 10 diagrams Teaching the elephant to tap-dance is never pretty. I’ll, ah, skip the character count. The program flows from left to right:
Read this line, and do what it says twice.
C (465 characters) #define F for(i=0;P-8;i+=2) #define V t[i #define P V+1] #define S V+2]),K(&L,4),i-=2) #define L V-2] K(double*t,int i){for(*++t=4;*t-8;*++t=V])*++t=V];}M(double*t){int i,p,b; F if(!P)for(p=1,b=i;i+=2,p;)P?P-1||–p||(P=8,M(t+b+2),K(t+b,i-b),i=b):++p; F P-6||(L=pow(L,S;F P-2&&P-7||(L*=(P-7?V+2]:1/S;F P-4&&(L+=(P-5?V+2]:-S; F L=V];}E(char*s,char*r){double t[99];char*e,i=2,z=0;for(;*s;i+=2)V]= strtod(s,&e),P=z=e-s&&z-4&&z-1?s=e,4:*s++&7;P=8;M(t+2);sprintf(r,”%g”,*t);} The first five newlines are required, the rest are there just for readability. I’ve counted the first five newlines as one character each. If … Read more
Assembler 427 bytes Obfuscated, assembled with the excellent A86 into a .com executable: dd 0db9b1f89h, 081bee3h, 0e8af789h, 0d9080080h, 0bdac7674h, 013b40286h dd 07400463ah, 0ccfe4508h, 08ce9f675h, 02fc8000h, 013b0057eh, 0feaac42ah dd 0bedf75c9h, 0ba680081h, 04de801h, 04874f73bh, 04474103ch, 0e8e8b60fh dd 08e8a003fh, 0e880290h, 0de0153h, 08b57e6ebh, 0d902a93eh, 046d891dh dd 08906c783h, 05f02a93eh, 03cffcee8h, 057197510h, 02a93e8bh, 08b06ef83h dd 05d9046dh, 02a93e89h, 03bc9d95fh, 0ac0174f7h, 074f73bc3h, 0f3cac24h … Read more
Ok, I think it’s time for my own implementation in Windows BATCH script (should work on Windows 2000 or later). Here is the code: @echo off set zero_to_nineteen=Zero One Two Three Four Five Six Seven Eight Nine Ten Eleven Twelve Thirteen Fourteen Fifteen Sixteen Seventeen Eighteen Nineteen set twenty_to_ninety=ignore ignore Twenty Thirty Forty Fifty Sixty … Read more