From 0425ce6206c20373ce8ff556fd61aa0cb7ae8f6a Mon Sep 17 00:00:00 2001 From: Cedric Cellier Date: Sat, 2 Jun 2018 14:36:02 +0200 Subject: [PATCH] Fix typo in the pigeon hole test description --- tests/pigeon/hole10.cnf | 4 ++-- tests/pigeon/hole6.cnf | 4 ++-- tests/pigeon/hole7.cnf | 4 ++-- tests/pigeon/hole8.cnf | 4 ++-- tests/pigeon/hole9.cnf | 4 ++-- 5 files changed, 10 insertions(+), 10 deletions(-) diff --git a/tests/pigeon/hole10.cnf b/tests/pigeon/hole10.cnf index 12a5b066..8bff3e1b 100644 --- a/tests/pigeon/hole10.cnf +++ b/tests/pigeon/hole10.cnf @@ -2,8 +2,8 @@ c File: hole10.cnf c c SOURCE: John Hooker (jh38+@andrew.cmu.edu) c -c DESCRIPTION: Pigeon hole problem of placing n (for file holen) pigeons -c in n+1 holes without placing 2 pigeons in the same hole +c DESCRIPTION: Pigeon hole problem of placing n+1 (for file holen) pigeons +c in n holes without placing 2 pigeons in the same hole c c NOTE: Part of the collection at the Forschungsinstitut fuer c anwendungsorientierte Wissensverarbeitung in Ulm Germany. diff --git a/tests/pigeon/hole6.cnf b/tests/pigeon/hole6.cnf index e450eec6..5ec07c59 100644 --- a/tests/pigeon/hole6.cnf +++ b/tests/pigeon/hole6.cnf @@ -2,8 +2,8 @@ c File: hole6.cnf c c SOURCE: John Hooker (jh38+@andrew.cmu.edu) c -c DESCRIPTION: Pigeon hole problem of placing n (for file holen) pigeons -c in n+1 holes without placing 2 pigeons in the same hole +c DESCRIPTION: Pigeon hole problem of placing n+1 (for file holen) pigeons +c in n holes without placing 2 pigeons in the same hole c c NOTE: Part of the collection at the Forschungsinstitut fuer c anwendungsorientierte Wissensverarbeitung in Ulm Germany. diff --git a/tests/pigeon/hole7.cnf b/tests/pigeon/hole7.cnf index d8f83b00..d8aa0a4a 100644 --- a/tests/pigeon/hole7.cnf +++ b/tests/pigeon/hole7.cnf @@ -2,8 +2,8 @@ c File: hole7.cnf c c SOURCE: John Hooker (jh38+@andrew.cmu.edu) c -c DESCRIPTION: Pigeon hole problem of placing n (for file holen) pigeons -c in n+1 holes without placing 2 pigeons in the same hole +c DESCRIPTION: Pigeon hole problem of placing n+1 (for file holen) pigeons +c in n holes without placing 2 pigeons in the same hole c c NOTE: Part of the collection at the Forschungsinstitut fuer c anwendungsorientierte Wissensverarbeitung in Ulm Germany. diff --git a/tests/pigeon/hole8.cnf b/tests/pigeon/hole8.cnf index 660cdfb5..69ed5409 100644 --- a/tests/pigeon/hole8.cnf +++ b/tests/pigeon/hole8.cnf @@ -2,8 +2,8 @@ c File: hole8.cnf c c SOURCE: John Hooker (jh38+@andrew.cmu.edu) c -c DESCRIPTION: Pigeon hole problem of placing n (for file holen) pigeons -c in n+1 holes without placing 2 pigeons in the same hole +c DESCRIPTION: Pigeon hole problem of placing n+1 (for file holen) pigeons +c in n holes without placing 2 pigeons in the same hole c c NOTE: Part of the collection at the Forschungsinstitut fuer c anwendungsorientierte Wissensverarbeitung in Ulm Germany. diff --git a/tests/pigeon/hole9.cnf b/tests/pigeon/hole9.cnf index 36437c11..51f1b4f9 100644 --- a/tests/pigeon/hole9.cnf +++ b/tests/pigeon/hole9.cnf @@ -2,8 +2,8 @@ c File: hole9.cnf c c SOURCE: John Hooker (jh38+@andrew.cmu.edu) c -c DESCRIPTION: Pigeon hole problem of placing n (for file holen) pigeons -c in n+1 holes without placing 2 pigeons in the same hole +c DESCRIPTION: Pigeon hole problem of placing n+1 (for file holen) pigeons +c in n holes without placing 2 pigeons in the same hole c c NOTE: Part of the collection at the Forschungsinstitut fuer c anwendungsorientierte Wissensverarbeitung in Ulm Germany.