o: programm...@jsoftware.com
Sent: Saturday, December 19, 2015 9:05 PM
Subject: Re: [Jprogramming] Advent 19
After an OBSCENE amount of thought, consumed by worries about
recursions, I found the easy solution to part 2.
The more I worked on part 2 the less I liked it, because in the end the
soluti
p;<~ 1 Y)"1 a7) {~ (i: >./)@:( ,@:>)@:(( {:@:({:"1)
) every)@:((1 {"1 a7) Eli"1 1 L:1 1 ])))^:195 a:, inb
┌┬─┐
││e│
└┴─┘
- Original Message -
From: Henry Rich
To: programm...@jsoftware.com
Sent: Saturday, December 19, 2015 9:05 PM
Subject: Re: [Jprogramming] Adven
After an OBSCENE amount of thought, consumed by worries about
recursions, I found the easy solution to part 2.
The more I worked on part 2 the less I liked it, because in the end the
solution is in an analysis of the data rather than the algorithm. But I
was pleased with part 1.
Spoiler...
replying to other message as it uses definitions there,
a7 =. ((0 { ]) ,&< 1 Y)"1 (\: (# * 1 + 4 * +/@((;: 'Ar')&e.) + 2 * +/@((;:
'Ar Rn Y' )&e.))@(1&{::"1 )) a2 =.(0 Y ; [: <@(isupper <;. 1 ] ) 1 Y )"1 a =.
> cutLF wdclippaste ''
NB. just keys mostly useless sorting, and simpler a2 wou
