| Andrew Cooke | Contents | Latest | RSS | Twitter | Previous | Next

C[omp]ute

Welcome to my blog, which was once a mailing list of the same name and is still generated by mail. Please reply via the "comment" links.

Always interested in offers/projects/new ideas. Eclectic experience in fields like: numerical computing; Python web; Java enterprise; functional languages; GPGPU; SQL databases; etc. Based in Santiago, Chile; telecommute worldwide. CV; email.

Personal Projects

Lepl parser for Python.

Colorless Green.

Photography around Santiago.

SVG experiment.

Professional Portfolio

Calibration of seismometers.

Data access via web services.

Cache rewrite.

Extending OpenSSH.

Last 100 entries

I Want To Be A Redneck!; Reverse Racism; The Lost Art Of Nomography; IBM Data Center (Photo); Interesting Account Of Gamma Hack; The Most Interesting Audiophile In The World; How did the first world war actually end?; Ky - Restaurant Santiago; The Black Dork Lives!; The UN Requires Unaninmous Decisions; LPIR - Steganography in Practice; How I Am 6; Clear Explanation of Verizon / Level 3 / Netflix; Teenage Girls; Formalising NSA Attacks; Switching Brakes (Tektro Hydraulic); Naim NAP 100 (Power Amp); AKG 550 First Impressions; Facebook manipulates emotions (no really); Map Reduce "No Longer Used" At Google; Removing RAID metadata; New Bike (Good Bike Shop, Santiago Chile); Removing APE Tags in Linux; Compiling Python 3.0 With GCC 4.8; Maven is Amazing; Generating Docs from a GitHub Wiki; Modular Shelves; Bash Best Practices; Good Emergency Gasfiter (Santiago, Chile); Readings in Recent Architecture; Roger Casement; Integrated Information Theory (Or Not); Possibly undefined macro AC_ENABLE_SHARED; Update on Charges; Sunburst Visualisation; Spectral Embeddings (Distances -> Coordinates); Introduction to Causality; Filtering To Help Colour-Blindness; ASUS 1015E-DS02 Too; Ready Player One; Writing Clear, Fast Julia Code; List of LatAm Novels; Running (for women); Building a Jenkins Plugin and a Jar (for Command Line use); Headphone Test Recordings; Causal Consistency; The Quest for Randomness; Chat Wars; Real-life Financial Co Without ACID Database...; Flexible Muscle-Based Locomotion for Bipedal Creatures; SQL Performance Explained; The Little Manual of API Design; Multiple Word Sizes; CRC - Next Steps; FizzBuzz; Update on CRCs; Decent Links / Discussion Community; Automated Reasoning About LLVM Optimizations and Undefined Behavior; A Painless Guide To CRC Error Detection Algorithms; Tests in Julia; Dave Eggers: what's so funny about peace, love and Starship?; Cello - High Level C Programming; autoreconf needs tar; Will Self Goes To Heathrow; Top 5 BioInformatics Papers; Vasovagal Response; Good Food in Vina; Chilean Drug Criminals Use Subsitution Cipher; Adrenaline; Stiglitz on the Impact of Technology; Why Not; How I Am 5; Lenovo X240 OpenSuse 13.1; NSA and GCHQ - Psychological Trolls; Finite Fields in Julia (Defining Your Own Number Type); Julian Assange; Starting Qemu on OpenSuse; Noisy GAs/TMs; Venezuela; Reinstalling GRUB with EFI; Instructions For Disabling KDE Indexing; Evolving Speakers; Changing Salt Size in Simple Crypt 3.0.0; Logarithmic Map (Moved); More Info; Words Found in Voynich Manuscript; An Inventory Of 3D Space-Filling Curves; Foxes Using Magnetic Fields To Hunt; 5 Rounds RC5 No Rotation; JP Morgan and Madoff; Ori - Secure, Distributed File System; Physical Unclonable Functions (PUFs); Prejudice on Reddit; Recursion OK; Optimizing Julia Code; Cash Handouts in Brazil; Couple Nice Music Videos; It Also Works!; Adaptive Plaintext; It Works!; RC5 Without Rotation (2)

© 2006-2013 Andrew Cooke (site) / post authors (content).

Hyperpublic's Challenge

From: andrew cooke <andrew@...>

Date: Fri, 25 Feb 2011 09:07:26 -0300

Since other people have posted solutions and linked to them from HN I thought
I may as well post mine.


First question is based on summing "influences" defined in a matrix.  Given
the form of the input it's simplest to construct a set of delayed functions,
one per input line.  These can then be called, and call each other to
calculate the sum.  Memoization would help, but isn't needed for such a small
problem.

#!/usr/bin/python3

# see http://hyperpublic.com/challenge/question1

from itertools import count
from sys import argv

# read test file from command line
filename = argv[1] if len(argv) > 1 else 'challenge2input.txt'

# build tree of functions that terminate in users with no influence
# scorers array allows reference to functions not yet defined
def make_scorer(line):
    def scorer(scorers):
        return sum(1 + scorers[user](scorers)
                   for (user, char) in zip(count(), line)
                   if char == 'X')
    return scorer

scorers = [make_scorer(line) for line in open(filename)]
scores = [scorer(scorers) for scorer in scorers]
scores.sort(reverse=True)
print(scores)
print('result', ''.join(str(score) for score in scores[0:3]))


Second question involves plitting the score for a user into groups of points,
so that the minimum number of groups are used.  Apparently this is a ell known
problem called "coin change", which makes sense.  I didn't know that, but did
see that a dynamic solution is going to work (if you start with N points then
the best solution is going to be with group i if the solution with N-P(i) is
smallest; repeat...).

I am pretty sure you can write this directly as a recursive expression with
memoization, but it's easier to just build the anser from the bottom:

#!/usr/bin/python3

# see http://hyperpublic.com/challenge/question2

from operator import mul
from functools import reduce

scores = [2349, 2102, 2001, 1747]
points = [98, 42, 23, 17, 3, 2]

big = 1+max(*scores)
best = [None] * big # either None or (min number, history)

# simple dynamic solution, building from bottom up
for n in range(big):
    for p in points:
        if n == p:
            best[n] = (1, [p])
            break
        elif n > p and best[n-p]:
            (m, h) = best[n-p]
            if not best[n] or best[n][0] > m+1:
                best[n] = (m+1, h+[p])

assert best[20] == (2, [3,17])
assert best[34] == (2, [17,17]) # not greedy

for score in scores:
    (n, history) = best[score]
    print(score, n, history)

print('result', reduce(mul, map(lambda score: best[score][0], scores)))


Andrew

Comment on this post