math-exercises 2.0.0 → 2.0.2

package/lib/exercises/calculLitteral/simplifying/reduceExpression.js

@@ -9,75 +9,71 @@ const addNode_1 = require("../../../tree/nodes/operators/addNode");
 const shuffle_1 = require("../../../utils/shuffle");
 const getReduceExpression = () => {
     const rand = (0, randint_1.randint)(0, 7);
-    let statement;
     let polynome1;
     let polynome2;
-    let answer;
     switch (rand) {
         case 0: // ax + b + cx + d
             polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
             polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
             break;
         case 1:
             polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
             polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
             break;
         case 2:
             polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
             polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
             break;
         case 3:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome1 = new polynomial_1.Polynomial([
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10, [0]),
+            ]);
             polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6), (0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
             break;
         case 4:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome1 = new polynomial_1.Polynomial([
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10, [0]),
+            ]);
             polynome2 = new polynomial_1.Polynomial([0, 0, (0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
             break;
         case 5:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome1 = new polynomial_1.Polynomial([
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10, [0]),
+            ]);
             polynome2 = new polynomial_1.Polynomial([0, (0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
             break;
         case 6:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
+            polynome1 = new polynomial_1.Polynomial([
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10),
+                (0, randint_1.randint)(-9, 10, [0]),
+            ]);
             polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
             break;
         default:
-            polynome1 = new polynomial_1.Polynomial([(0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10), (0, randint_1.randint)(-9, 10, [0])]);
-            polynome2 = new polynomial_1.Polynomial([(0, randint_1.randint)(-5, 6, [0])]);
-            statement = new addNode_1.AddNode(new polynomial_1.Polynomial([1, 2]).toTree(), new polynomial_1.Polynomial([3, 4]).toTree());
-            statement.shuffle();
-            answer = polynome1.add(polynome2).toTree().toTex();
-            break;
+            throw Error("something went wrong");
     }
+    const statement = new addNode_1.AddNode(polynome1.toTree(), polynome2.toTree());
+    statement.shuffle();
+    const statementTex = statement.toTex();
+    const answer = polynome1.add(polynome2).toTree().toTex();
     const question = {
-        instruction: `Réduire l'expression suivante : $${statement.toTex()}$`,
-        startStatement: statement.toTex(),
+        instruction: `Réduire l'expression suivante : $${statementTex}$`,
+        startStatement: statementTex,
         answer,
-        keys: ['x'],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer, rand, polynome1Coeffs: polynome1.coefficients },
+        keys: ["x"],
+        answerFormat: "tex",
+        identifiers: {
+            rand,
+            polynome1Coeffs: polynome1.coefficients,
+            polynome2Coeffs: polynome2.coefficients,
+        },
     };
     return question;
 };
@@ -93,15 +89,26 @@ const getPropositions = (n, { answer, rand, polynome1Coeffs }) => {
     }
     return (0, shuffle_1.shuffle)(propositions);
 };
+const isAnswerValid = (ans, { polynome1Coeffs, polynome2Coeffs, rand }) => {
+    const polynome1 = new polynomial_1.Polynomial(polynome1Coeffs);
+    const polynome2 = new polynomial_1.Polynomial(polynome2Coeffs);
+    const answer = polynome1
+        .add(polynome2)
+        .toTree({ forbidPowerToProduct: true });
+    const texs = answer.toAllValidTexs();
+    console.log(texs);
+    return texs.includes(ans);
+};
 exports.reduceExpression = {
-    id: 'reduceExpression',
-    connector: '=',
+    id: "reduceExpression",
+    connector: "=",
     isSingleStep: false,
-    label: 'Réduire une expression',
-    levels: ['4ème', '3ème', '2nde', 'CAP', '2ndPro'],
-    sections: ['Calcul littéral'],
+    label: "Réduire une expression",
+    levels: ["4ème", "3ème", "2nde", "CAP", "2ndPro"],
+    sections: ["Calcul littéral"],
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getReduceExpression, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
+    isAnswerValid,
 };

package/lib/exercises/combinatory/anagrams.d.ts

@@ -1,9 +1,7 @@
-import { MathExercise } from '../../exercises/exercise';
-type QCMProps = {
-    answer: string;
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
     word: string;
 };
-type VEAProps = {};
-export declare const anagrams: MathExercise<QCMProps, VEAProps>;
+export declare const anagrams: MathExercise<Identifiers>;
 export {};
 //# sourceMappingURL=anagrams.d.ts.map

package/lib/exercises/combinatory/anagrams.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"anagrams.d.ts","sourceRoot":"","sources":["../../../src/exercises/combinatory/anagrams.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AAsGlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAmDnB,eAAO,MAAM,QAAQ,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWrD,CAAC"}
+{"version":3,"file":"anagrams.d.ts","sourceRoot":"","sources":["../../../src/exercises/combinatory/anagrams.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAsGlC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAsDF,eAAO,MAAM,QAAQ,EAAE,YAAY,CAAC,WAAW,CAY9C,CAAC"}

package/lib/exercises/combinatory/anagrams.js

@@ -6,104 +6,104 @@ const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestio
 const randint_1 = require("../../math/utils/random/randint");
 const random_1 = require("../../utils/random");
 const words = [
-    'angle',
-    'armoire',
-    'banc',
-    'bureau',
-    'cabinet',
-    'carreau',
-    'chaise',
-    'classe',
-    'clé',
-    'coin',
-    'couloir',
-    'dossier',
-    'eau',
-    'école',
-    'écriture',
-    'entrée',
-    'escalier',
-    'étagère',
-    'étude',
-    'extérieur',
-    'fenêtre',
-    'intérieur',
-    'lavabo',
-    'lecture',
-    'lit',
-    'marche',
-    'matelas',
-    'maternelle',
-    'meuble',
-    'mousse',
-    'mur',
-    'peluche',
-    'placard',
-    'plafond',
-    'porte',
-    'portemanteau',
-    'poubelle',
-    'radiateur',
-    'rampe',
-    'récréation',
-    'rentrée',
-    'rideau',
-    'robinet',
-    'salle',
-    'savon',
-    'serrure',
-    'serviette',
-    'siège',
-    'sieste',
-    'silence',
-    'sol',
-    'sommeil',
-    'sonnette',
-    'sortie',
-    'table',
-    'tableau',
-    'tabouret',
-    'tapis',
-    'tiroir',
-    'toilette',
-    'vitre',
+    "angle",
+    "armoire",
+    "banc",
+    "bureau",
+    "cabinet",
+    "carreau",
+    "chaise",
+    "classe",
+    "clé",
+    "coin",
+    "couloir",
+    "dossier",
+    "eau",
+    "école",
+    "écriture",
+    "entrée",
+    "escalier",
+    "étagère",
+    "étude",
+    "extérieur",
+    "fenêtre",
+    "intérieur",
+    "lavabo",
+    "lecture",
+    "lit",
+    "marche",
+    "matelas",
+    "maternelle",
+    "meuble",
+    "mousse",
+    "mur",
+    "peluche",
+    "placard",
+    "plafond",
+    "porte",
+    "portemanteau",
+    "poubelle",
+    "radiateur",
+    "rampe",
+    "récréation",
+    "rentrée",
+    "rideau",
+    "robinet",
+    "salle",
+    "savon",
+    "serrure",
+    "serviette",
+    "siège",
+    "sieste",
+    "silence",
+    "sol",
+    "sommeil",
+    "sonnette",
+    "sortie",
+    "table",
+    "tableau",
+    "tabouret",
+    "tapis",
+    "tiroir",
+    "toilette",
+    "vitre",
 ];
 const letters = [
-    'a',
-    'b',
-    'c',
-    'd',
-    'e',
-    'f',
-    'g',
-    'h',
-    'i',
-    'j',
-    'k',
-    'l',
-    'm',
-    'n',
-    'o',
-    'p',
-    'q',
-    'r',
-    's',
-    't',
-    'u',
-    'v',
-    'w',
-    'x',
-    'y',
-    'z',
-    'é',
-    'è',
-    'à',
-    'ç',
+    "a",
+    "b",
+    "c",
+    "d",
+    "e",
+    "f",
+    "g",
+    "h",
+    "i",
+    "j",
+    "k",
+    "l",
+    "m",
+    "n",
+    "o",
+    "p",
+    "q",
+    "r",
+    "s",
+    "t",
+    "u",
+    "v",
+    "w",
+    "x",
+    "y",
+    "z",
+    "é",
+    "è",
+    "à",
+    "ç",
 ];
 const getAnagramsQuestion = () => {
     const word = (0, random_1.random)(words);
     const repeats = [];
-    const wordLetters = word.split('');
+    const wordLetters = word.split("");
     letters.forEach((letter) => {
         const nbOfRepeats = wordLetters.filter((l) => l === letter).length;
         if (nbOfRepeats > 1)
@@ -115,43 +115,47 @@ const getAnagramsQuestion = () => {
         return n * getFacto(n - 1);
     };
     const facto = word
-        .split('')
+        .split("")
         .map((el, index) => index + 1)
         .reduce((acc, curr) => acc * curr, 1);
     let arrangements = 1;
     repeats.forEach((nbOfRepeats) => {
         arrangements *= getFacto(nbOfRepeats);
     });
-    const answer = facto / arrangements + '';
+    const answer = facto / arrangements + "";
     const question = {
         answer,
         instruction: `Combien d'anagrammes mathématiques du mot ${word} sont possibles ? `,
         keys: [],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer, word },
+        answerFormat: "tex",
+        identifiers: { word },
     };
     return question;
 };
 const getPropositions = (n, { answer, word }) => {
     const propositions = [];
     (0, exercise_1.addValidProp)(propositions, answer);
-    (0, exercise_1.tryToAddWrongProp)(propositions, Math.pow(word.length, word.length) + '');
-    (0, exercise_1.tryToAddWrongProp)(propositions, (word.length * (word.length + 1)) / 2 + '');
-    (0, exercise_1.tryToAddWrongProp)(propositions, word.length * word.length + '');
+    (0, exercise_1.tryToAddWrongProp)(propositions, Math.pow(word.length, word.length) + "");
+    (0, exercise_1.tryToAddWrongProp)(propositions, (word.length * (word.length + 1)) / 2 + "");
+    (0, exercise_1.tryToAddWrongProp)(propositions, word.length * word.length + "");
     while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(1000, 10000) + '');
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(1000, 10000) + "");
     }
     return (0, exercise_1.shuffleProps)(propositions, n);
 };
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
 exports.anagrams = {
-    id: 'anagrams',
-    connector: '=',
+    id: "anagrams",
+    connector: "=",
     label: "Compter le nombre d'anagrammes d'un mot",
-    levels: ['TermSpé'],
+    levels: ["TermSpé"],
     isSingleStep: true,
-    sections: ['Combinatoire et dénombrement'],
+    sections: ["Combinatoire et dénombrement"],
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getAnagramsQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
+    isAnswerValid,
 };

package/lib/exercises/combinatory/ballsCounting.d.ts

@@ -1,12 +1,10 @@
-import { MathExercise } from '../../exercises/exercise';
-type QCMProps = {
-    answer: string;
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
     type: number;
     reds: number;
     greens: number;
     blacks: number;
 };
-type VEAProps = {};
-export declare const ballsCounting: MathExercise<QCMProps, VEAProps>;
+export declare const ballsCounting: MathExercise<Identifiers>;
 export {};
 //# sourceMappingURL=ballsCounting.d.ts.map

package/lib/exercises/combinatory/ballsCounting.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ballsCounting.d.ts","sourceRoot":"","sources":["../../../src/exercises/combinatory/ballsCounting.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AAIlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AA6FnB,eAAO,MAAM,aAAa,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAW1D,CAAC"}
+{"version":3,"file":"ballsCounting.d.ts","sourceRoot":"","sources":["../../../src/exercises/combinatory/ballsCounting.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAIlC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;CAChB,CAAC;AAsHF,eAAO,MAAM,aAAa,EAAE,YAAY,CAAC,WAAW,CAYnD,CAAC"}

package/lib/exercises/combinatory/ballsCounting.js

@@ -6,8 +6,8 @@ const getDistinctQuestions_1 = require("../../exercises/utils/getDistinctQuestio
 const randint_1 = require("../../math/utils/random/randint");
 const getBallsCountingQuestion = () => {
     const type = (0, randint_1.randint)(0, 6);
-    let instruction = '';
-    let answer = '';
+    let instruction = "";
+    let answer = "";
     const blacks = (0, randint_1.randint)(2, 6);
     const greens = (0, randint_1.randint)(2, 6);
     const reds = (0, randint_1.randint)(3, 6);
@@ -15,31 +15,34 @@ const getBallsCountingQuestion = () => {
     switch (type) {
         case 0:
             instruction = ``;
-            answer = total * (total - 1) * (total - 2) + '';
+            answer = total * (total - 1) * (total - 2) + "";
             break;
         case 1:
             instruction = `comportant trois boules rouges`;
-            answer = reds * (reds - 1) * (reds - 2) + '';
+            answer = reds * (reds - 1) * (reds - 2) + "";
             break;
         case 2:
             instruction = `ne comportant pas de boule noire`;
-            answer = (reds + greens) * (reds + greens - 1) * (reds + greens - 2) + '';
+            answer = (reds + greens) * (reds + greens - 1) * (reds + greens - 2) + "";
             break;
         case 3:
             instruction = `comportant au moins une boule noire`;
-            answer = total * (total - 1) * (total - 2) - (reds + greens) * (reds + greens - 1) * (reds + greens - 2) + '';
+            answer =
+                total * (total - 1) * (total - 2) -
+                    (reds + greens) * (reds + greens - 1) * (reds + greens - 2) +
+                    "";
             break;
         case 4:
             instruction = `comportant trois boules de trois couleurs différentes`;
-            answer = 6 * (blacks * greens * reds) + '';
+            answer = 6 * (blacks * greens * reds) + "";
             break;
         case 5:
             instruction = `comportant exactement une boule verte et deux boules noires`;
-            answer = 6 * (greens * blacks * (blacks - 1)) + '';
+            answer = 6 * (greens * blacks * (blacks - 1)) + "";
             break;
         case 6:
             instruction = `comportant exactement une boule verte`;
-            answer = 6 * greens * (reds + blacks) * (reds + blacks - 1) + '';
+            answer = 6 * greens * (reds + blacks) * (reds + blacks - 1) + "";
     }
     const question = {
         answer: answer,
@@ -47,8 +50,8 @@ const getBallsCountingQuestion = () => {
     On tire successivement et sans remise 3 boules dans l'urne. 
     Combien de tirages ${instruction} sont possibles ?`,
         keys: [],
-        answerFormat: 'tex',
-        qcmGeneratorProps: { answer, type, reds, greens, blacks },
+        answerFormat: "tex",
+        identifiers: { type, reds, greens, blacks },
     };
     return question;
 };
@@ -58,48 +61,52 @@ const getPropositions = (n, { answer, type, reds, greens, blacks }) => {
     const total = reds + greens + blacks;
     switch (type) {
         case 0:
-            (0, exercise_1.tryToAddWrongProp)(propositions, total * total * total + '');
-            (0, exercise_1.tryToAddWrongProp)(propositions, 6 + '');
+            (0, exercise_1.tryToAddWrongProp)(propositions, total * total * total + "");
+            (0, exercise_1.tryToAddWrongProp)(propositions, 6 + "");
             break;
         case 1:
-            (0, exercise_1.tryToAddWrongProp)(propositions, reds * reds * reds + '');
-            (0, exercise_1.tryToAddWrongProp)(propositions, 1 + '');
+            (0, exercise_1.tryToAddWrongProp)(propositions, reds * reds * reds + "");
+            (0, exercise_1.tryToAddWrongProp)(propositions, 1 + "");
             break;
         case 2:
-            (0, exercise_1.tryToAddWrongProp)(propositions, (reds + greens) * (reds + greens) * (reds + greens) + '');
-            (0, exercise_1.tryToAddWrongProp)(propositions, 6 * blacks * (reds + greens) * (reds + greens - 1) + '');
+            (0, exercise_1.tryToAddWrongProp)(propositions, (reds + greens) * (reds + greens) * (reds + greens) + "");
+            (0, exercise_1.tryToAddWrongProp)(propositions, 6 * blacks * (reds + greens) * (reds + greens - 1) + "");
             break;
         case 3:
-            (0, exercise_1.tryToAddWrongProp)(propositions, (reds + greens) * (reds + greens) * (reds + greens) + '');
-            (0, exercise_1.tryToAddWrongProp)(propositions, 3 * (reds + greens) * (reds + greens - 1) + '');
+            (0, exercise_1.tryToAddWrongProp)(propositions, (reds + greens) * (reds + greens) * (reds + greens) + "");
+            (0, exercise_1.tryToAddWrongProp)(propositions, 3 * (reds + greens) * (reds + greens - 1) + "");
             break;
         case 4:
-            (0, exercise_1.tryToAddWrongProp)(propositions, blacks * greens * reds + '');
-            (0, exercise_1.tryToAddWrongProp)(propositions, 6 + '');
+            (0, exercise_1.tryToAddWrongProp)(propositions, blacks * greens * reds + "");
+            (0, exercise_1.tryToAddWrongProp)(propositions, 6 + "");
             break;
         case 5:
-            (0, exercise_1.tryToAddWrongProp)(propositions, 6 * greens * blacks * blacks + '');
-            (0, exercise_1.tryToAddWrongProp)(propositions, 6 + '');
+            (0, exercise_1.tryToAddWrongProp)(propositions, 6 * greens * blacks * blacks + "");
+            (0, exercise_1.tryToAddWrongProp)(propositions, 6 + "");
             break;
         case 6:
-            (0, exercise_1.tryToAddWrongProp)(propositions, 6 * (blacks * greens * reds) + '');
-            (0, exercise_1.tryToAddWrongProp)(propositions, greens * (reds + blacks) * (reds + blacks - 1) + '');
+            (0, exercise_1.tryToAddWrongProp)(propositions, 6 * (blacks * greens * reds) + "");
+            (0, exercise_1.tryToAddWrongProp)(propositions, greens * (reds + blacks) * (reds + blacks - 1) + "");
             break;
     }
     while (propositions.length < n) {
-        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(1, 100) + '');
+        (0, exercise_1.tryToAddWrongProp)(propositions, (0, randint_1.randint)(1, 100) + "");
     }
     return (0, exercise_1.shuffleProps)(propositions, n);
 };
+const isAnswerValid = (ans, { answer }) => {
+    return ans === answer;
+};
 exports.ballsCounting = {
-    id: 'ballsCounting',
-    connector: '=',
-    label: 'Dénombrement avec des boules',
-    levels: ['TermSpé'],
+    id: "ballsCounting",
+    connector: "=",
+    label: "Dénombrement avec des boules",
+    levels: ["TermSpé"],
     isSingleStep: true,
-    sections: ['Combinatoire et dénombrement'],
+    sections: ["Combinatoire et dénombrement"],
     generator: (nb) => (0, getDistinctQuestions_1.getDistinctQuestions)(getBallsCountingQuestion, nb),
     qcmTimer: 60,
     freeTimer: 60,
     getPropositions,
+    isAnswerValid,
 };

package/lib/exercises/combinatory/diceCounting.d.ts

@@ -1,9 +1,7 @@
-import { MathExercise } from '../../exercises/exercise';
-type QCMProps = {
-    answer: string;
+import { MathExercise } from "../../exercises/exercise";
+type Identifiers = {
     type: number;
 };
-type VEAProps = {};
-export declare const diceCounting: MathExercise<QCMProps, VEAProps>;
+export declare const diceCounting: MathExercise<Identifiers>;
 export {};
 //# sourceMappingURL=diceCounting.d.ts.map

package/lib/exercises/combinatory/diceCounting.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"diceCounting.d.ts","sourceRoot":"","sources":["../../../src/exercises/combinatory/diceCounting.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,YAAY,EAOb,MAAM,0BAA0B,CAAC;AAKlC,KAAK,QAAQ,GAAG;IACd,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AACF,KAAK,QAAQ,GAAG,EAAE,CAAC;AAuGnB,eAAO,MAAM,YAAY,EAAE,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAWzD,CAAC"}
+{"version":3,"file":"diceCounting.d.ts","sourceRoot":"","sources":["../../../src/exercises/combinatory/diceCounting.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,YAAY,EAQb,MAAM,0BAA0B,CAAC;AAKlC,KAAK,WAAW,GAAG;IACjB,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAgHF,eAAO,MAAM,YAAY,EAAE,YAAY,CAAC,WAAW,CAYlD,CAAC"}