# Haskell Quiz/Countdown

### From HaskellWiki

< Haskell Quiz(Difference between revisions)

(added Graham Huttons JFP paper to the solutions) |
(+cat) |
||

Line 9: | Line 9: | ||

* [http://www.cs.nott.ac.uk/~gmh/bib.html#countdown Graham Hutton] (JFP paper) |
* [http://www.cs.nott.ac.uk/~gmh/bib.html#countdown Graham Hutton] (JFP paper) |
||

* [[Haskell Quiz/Countdown/Solution Dolio|Dan Doel]] |
* [[Haskell Quiz/Countdown/Solution Dolio|Dan Doel]] |
||

+ | |||

+ | [[Category:Haskell Quiz|Countdown]] |

## Latest revision as of 10:20, 13 January 2007

This question was based on a UK game show. Given a target number, a set of source numbers which may be used at most once, and the 4 basic arithmetic operators (+, -, *, /), construct the whole number closest to the target.

## [edit] 1 The Problem

## [edit] 2 Solutions

- Graham Hutton (JFP paper)
- Dan Doel