From 647a3c4a2e28439e1a65f86c8f83b9c3feb6a0a3 Mon Sep 17 00:00:00 2001 From: Jxtopher <39927513+Jxtopher@users.noreply.github.com> Date: Tue, 13 Jul 2021 22:56:08 +0200 Subject: [PATCH] Update backtracking/magic_sequence.cpp Co-authored-by: David Leal --- backtracking/magic_sequence.cpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/backtracking/magic_sequence.cpp b/backtracking/magic_sequence.cpp index 1b22c674f..753da4c49 100644 --- a/backtracking/magic_sequence.cpp +++ b/backtracking/magic_sequence.cpp @@ -5,8 +5,8 @@ * @details Solve the magic sequence problem with a backtraking * * "A magic sequence of length $n$ is a sequence of integers $x_0 - * \ldots x_{n-1}$ between $0$ and $n-1$, such that for all $i$ - * in $0$ to $n-1$, the number $i$ occurs exactly $x_i$ times in + * \ldots x_{n-1}$ between $0$ and $n-1$, such that for all $i$ + * in $0$ to $n-1$, the number $i$ occurs exactly $x_i$ times in * the sequence. For instance, $6,2,1,0,0,0,1,0,0,0$ is a magic * sequence since $0$ occurs $6$ times in it, $1$ occurs twice, etc." * Quote taken from the [CSPLib](https://www.csplib.org/Problems/prob019/) website