**From New Scientist #1484, 28th November 1985** [link]

Three football teams (A, B and C) are to play each other once, and four other football teams (D, E, F, and G) are also to play each other once. After some — or perhaps all — of the matches had been played, two separate tables were drawn up giving some details of the games played, won, lost etc.

But in these two tables, just to make things more interesting, letters have been substituted for digits. In both tables the same letter stands for the same digit (from 0 to 9) whenever it appears, and different letters stand for different digits.

The tables looked like this:

(Two points are given for a win, and one point to each side in a drawn match).

Find the score in each match.

[enigma336]

### Like this:

Like Loading...

This Python program uses the

Football()helper class from theenigma.pylibrary, even so it is a bit tedious. It runs in 42ms.Solution:The scores in the matches played so far are: A vs. C = 5-3; B vs. C = 4-5; D vs. E = 0-1; D vs. F = 3-3; E vs. F = 0-1; F vs. G = 5-3.The following matches are not yet played: A vs. B, D vs. G, E vs. G.