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.

C-ORM: docs, API.

Last 100 entries

Removing Lowers; Mnesiacs; [Maths, Link] Dividing By Zero; [Book, Review] Ray Monk - Ludwig Wittgenstein: The Duty Of Genius; [Link, Bike, Computing] Evolving Lacing Patterns; [Jam] Strawberry and Orange Jam; [Chile, Privacy] Biometric Check During Mail Delivery; [Link, Chile, Spanish] Article on the Chilean Drought; [Bike] Extended Gear Ratios, Shimano XT M8000 (24/36 Chainring); Get Coffee Quotes for Cat Soft LLC; [Link, Politics, USA] The Future Of American Democracy; Mass Hysteria; [Review, Books, Links] Kazuo Ishiguro - Never Let Me Go; [Link, Books] David Mitchell's Favourite Japanese Fiction; [Link, Bike] Rear Suspension Geometry; [Link, Cycling, Art] Strava Artwork; [Link, Computing] Useful gcc flags; [Link] Voynich Manuscript Decoded; [Bike] Notes on Servicing Suspension Forks; [Links, Computing] Snap, Flatpack, Appimage; [Link, Computing] Oracle is leaving Java (to die); [Link, Politics] Cubans + Ultrasonics; [Book, Link] Laurent Binet; VirtualBox; [Book, Link] No One's Ways; [Link] The Biggest Problem For Cyclists Is Bad Driving; [Computing] Doxygen, Sphinx, Breathe; [Admin] Brokw Recent Permalinks; [Bike, Chile] Buying Bearings in Santiago; [Computing, Opensuse] Upgrading to 42.3; [Link, Physics] First Support for a Physics Theory of Life; [Link, Bike] Peruvian Frame Maker; [Link] Awesome Game Theory Tit-For-Tat Thing; [Food, Review] La Fabbrica - Good Italian Food In Santiago; [Link, Programming] MySQL UTF8 Broken; [Link, Books] Latin American Authors; [Link, Computing] Optimizatin Puzzle; [Link, Books, Politics] Orwell Prize; [Link] What the Hell Is Happening With Qatar?; [Link] Deep Learning + Virtual Tensor Machines; [Link] Scaled Composites: Largest Wingspan Ever; [Link] SCP Foundation; [Bike] Lessons From 2 Leading 2 Trailing; [Link] Veg Restaurants in Santiago; [Link] List of Contemporary Latin American Authors; [Bike] FTHR; [Link] Whoa - NSA Reduces Collection (of US Residents); [Link] Red Bull's Breitbart; [Link] Linux Threads; [Link] Punycode; [Link] Bull / Girl Statues on Wall Street; [Link] Beautiful Chair Video; Update: Lower Pressures; [Link] Neat Python Exceptions; [Link] Fix for Windows 10 to Avoid Ads; [Link] Attacks on ZRTP; [Link] UK Jazz Invasion; [Review] Cuba; [Link] Aricle on Gender Reversal of US Presidential Debate; {OpenSuse] Fix for Network Offline in Updater Applet; [Link] Parkinson's Related to Gut Flora; Farellones Bike Park; [Meta] Tags; Update: Second Ride; Schwalbe Thunder Burt 2.1 v Continental X-King 2.4; Mountain Biking in Santiago; Books on Ethics; Security Fail from Command Driven Interface; Everything Old is New Again; Interesting Take on Trump's Lies; Chutney v6; References on Entropy; Amusing "Alexa.." broadcast; The Shame of Chile's Education System; Playing mp4 gifs in Firefox on Opensuses Leap 42.2; Concurrency at Microsoft; Globalisation: Uk -> Chile; OpenSuse 42.2 and Synaptics Touch-Pads; Even; Cherry Jam; Lebanese Writer Amin Maalouf; C++ - it's the language of the future; Learning From Trump; Chinese Writer Hu Fayun; And; Apricot Jam; Also; Excellent Article on USA Politics; Oh Metafilter; Prejudice Against The Rurals; Also, Zizek; Trump; Why Trump Won; Doxygen + Latex on CentOS 6; SMASH - Solve 5 Biggest Problems in Physics; Good article on racism, brexit, and social divides; Grandaddy are back!; Consciousness From Max Entropy; Democrats; Harvard Will Fix Black Poverty; Modelling Bicycle Wheels

© 2006-2017 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