Constraint fixes for Tutorial 1

ia-toki · Dec 2, 2016 · 368dd3c · 368dd3c
1 parent f228f2b
commit 368dd3c
Showing 1 changed file with 3 additions and 3 deletions.
diff --git a/docs/tutorials/tutorial_1.rst b/docs/tutorials/tutorial_1.rst
@@ -154,7 +154,7 @@ The following is a problem spec that is derived directly from the problem statem
         }
 
         void Constraints() {
-            CONS(1 <= N && N <= 100000);
+            CONS(2 <= N && N <= 100000);
             CONS(eachElementBetween(A, -1000000, 1000000));
         }
 
@@ -315,7 +315,7 @@ So far, we have considered various cases for which the answer has some propertie
 
 
 11. N = 100000
-     The maximum value of N. This will reject solutions that use array with size less than 100000.
+     The maximum value of N. This will reject solutions that use array with size less than 100,000.
 
      ``CASE(N = 100000, randomElements(50000, 50000));``
 
@@ -422,9 +422,9 @@ Here is the complete spec file for our Best Pair problem.
             CASE(N = 100, randomElements(20, 50));
             CASE(N = 1000, randomElements(300, 300));
             CASE(N = 10000, randomElements(2500, 6000));
-            CASE(N = 100000, randomElements(50000, 50000));
 
             // The maximum value of N
+            CASE(N = 100000, randomElements(50000, 50000));
             CASE(N = 100000, randomElements(10000, 80000));
             CASE(N = 100000, randomElements(80000, 10000));
         }