diff --git a/examples/patience.mlw b/examples/patience.mlw index ba5028add2d7f64d50272affb4c59122952a9e69..ba7cfc23bb94c02cf211594f5608d56e10642bf3 100644 --- a/examples/patience.mlw +++ b/examples/patience.mlw @@ -16,13 +16,13 @@ numbers instead of cards. If the input sequence is 9, 7, 10, 9, 5, 4, and 10, then the stacks develop as {h <pre>} -<[[9]]> -<[[7, 9]]> -<[[7, 9]], [[10]]> -<[[7, 9]], [[9, 10]]> -<[[5, 7, 9]], [[9, 10]]> -<[[4, 5, 7, 9]], [[9, 10]]> -<[[4, 5, 7, 9]], [[9, 10]], [[10]]> +<[[9]]> +<[[7, 9]]> +<[[7, 9]], [[10]]> +<[[7, 9]], [[9, 10]]> +<[[5, 7, 9]], [[9, 10]]> +<[[4, 5, 7, 9]], [[9, 10]]> +<[[4, 5, 7, 9]], [[9, 10]], [[10]]> {h </pre>} Verify the claim is that the number of stacks at the end of the game diff --git a/examples/verifythis_2015_relaxed_prefix.mlw b/examples/verifythis_2015_relaxed_prefix.mlw index a76ea69582f36c1dff5b861fdd09b2017d9eedd2..49226eb186f324313aa5e47c9f01856430a2863c 100644 --- a/examples/verifythis_2015_relaxed_prefix.mlw +++ b/examples/verifythis_2015_relaxed_prefix.mlw @@ -46,7 +46,7 @@ public class Relaxed { public static boolean isRelaxedPrefix(int[] pat, int[] a) { int shift = 0; - for(int i=0; i<pat.length; i++) { + for(int i=0; i<pat.length; i++) { if (pat[i]!=a[i-shift]) if (shift==0) shift=1; else return false;