**From New Scientist #1108, 22nd June 1978** [link]

Four football teams (*A*, *B*, *C* and *D*) are to play each other once. After some of the matches had been played a table giving some details of the numbers won, lost, drawn, and so on was drawn up.

But unfortunately the digits have been replaced by letters. Each letter stands for the same digit (from 0 to 9) whenever it appears and different letters stand for different digits.

The table looks 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.

[puzzle57]

### Like this:

Like Loading...

This Python program uses the

Football()helper class from theenigma.pylibrary. It runs in 114ms.Run:[ @repl.it ]Solution:The scores in the played matches are: A vs C = 4 – 4; B vs C = 0 – 3; B vs D = 3 – 0; C vs D = 2 – 0.The remaining matches (A vs B, A vs D) are not yet played.