ICPC contest archive archived copy of http://www.pi.informatik.tu-darmstadt.de/acm-contest/2000/nwerc/problemset/ (2002-05-16 05:13) (Wayback snapshot 2002-05-16 05:13; fetched 2026-04-16) catalogue: nwerc-2000 wayback live
TUD ICPC Northwestern Europe Programming Contest ACM
Contest 2000 - Problemset

Sponsored by:
IBM
Opus5

The problemset is available as pdf. A HTML-Version with test-inputs and test-outputs will follow shortly.

  1. Problem: Railroads Input and Output
  2. Problem: Ouroboros Snake Input and Output
  3. Problem: Vito's family Input and Output
  4. Problem: Smith Numbers Input and Output
  5. Problem: Chainsaw Massacre Input and Output
  6. Problem: Erdös numbers Input and Output
  7. Problem: Echo Input and Output
  8. Problem: Fold-up Patterns Input and Output

The problemset was developed in cooperation with the South-Western Contest group in Valladolid/Spain. You will find many common problems.

Many of the problems were used at the Mid-Central Contest in Freiburg/Germany.

Old problemsets are available from our TUD Programming Contest or you can visit the problem archives.


Valid HTML 4.0! Last updates: Monday, 05.11.2001 17:14:33 MET