math-exercises 3.0.190 → 3.0.192

package/lib/exercises/math/dataRepresentations/scatterPlot/scatterPlotInterpreting.js

@@ -0,0 +1,403 @@
+import { tryToAddWrongProp, addValidProp, propWhile, shuffleProps, } from "../../../../exercises/exercise.js";
+import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { numberVEA } from "../../../../exercises/vea/numberVEA.js";
+import { greenMain, orange, red } from "../../../../geogebra/colors.js";
+import { GeogebraConstructor } from "../../../../geogebra/geogebraConstructor.js";
+import { Point, PointConstructor, } from "../../../../math/geometry/point.js";
+import { randint } from "../../../../math/utils/random/randint.js";
+import { NodeConstructor, } from "../../../../tree/nodes/nodeConstructor.js";
+import { add } from "../../../../tree/nodes/operators/addNode.js";
+import { ClosureType } from "../../../../tree/nodes/sets/closure.js";
+import { IntervalNode } from "../../../../tree/nodes/sets/intervalNode.js";
+import { NodeComparator } from "../../../../tree/utilities/nodeComparator.js";
+import { coinFlip } from "../../../../utils/alea/coinFlip.js";
+import { probaFlip } from "../../../../utils/alea/probaFlip.js";
+import { probaLawFlip } from "../../../../utils/alea/probaLawFlip.js";
+import { random } from "../../../../utils/alea/random.js";
+import { shuffle } from "../../../../utils/alea/shuffle.js";
+import { getCartesiansProducts } from "../../../../utils/arrays/cartesianProducts.js";
+const getComponentOfPointForStrGroupBy = (point, strGroupBy) => {
+    switch (strGroupBy) {
+        case "x":
+            return point.x;
+        case "y":
+            return point.y;
+        default:
+            throw new Error("Unsupported strGroupBy: " + strGroupBy);
+    }
+};
+const getTexCondition = (strGroupBy, nodeDataClass) => {
+    if (NodeComparator.isEqualViaSub(nodeDataClass.a, nodeDataClass.b)) {
+        return `${strGroupBy} = ${nodeDataClass.a.toTex()}`;
+    }
+    else {
+        switch (nodeDataClass.closure) {
+            case ClosureType.FF:
+                return `${nodeDataClass.a.toTex()} \\leq ${strGroupBy} \\leq ${nodeDataClass.b.toTex()}`;
+            case ClosureType.FO:
+                return `${nodeDataClass.a.toTex()} \\leq ${strGroupBy} < ${nodeDataClass.b.toTex()}`;
+            case ClosureType.OF:
+                return `${nodeDataClass.a.toTex()} < ${strGroupBy} \\leq ${nodeDataClass.b.toTex()}`;
+            case ClosureType.OO:
+                return `${nodeDataClass.a.toTex()} < ${strGroupBy} < ${nodeDataClass.b.toTex()}`;
+        }
+    }
+};
+const getInstruction = (identifiers) => {
+    const { strGroupBy, nodeIdsDataClass } = identifiers;
+    const nodeDataClass = NodeConstructor.fromIdentifiers(nodeIdsDataClass);
+    return `Si l'on considère le nuage de points ci-dessous, 
+combien y a-t-il d'éléments avec $${getTexCondition(strGroupBy, nodeDataClass)}$ ?`;
+};
+const getAnswerNode = (identifiers) => {
+    const { pointIds, strGroupBy, nodeIdsDataClass } = identifiers;
+    const arrPoint = pointIds.map((pointIds) => PointConstructor.fromIdentifiers(pointIds));
+    const nodeDataClass = NodeConstructor.fromIdentifiers(nodeIdsDataClass);
+    const count = arrPoint.filter((point) => {
+        const nodeComponent = getComponentOfPointForStrGroupBy(point, strGroupBy);
+        return nodeDataClass.includes(nodeComponent);
+    }).length;
+    return count.toTree();
+};
+const getAnswer = (identifiers) => {
+    return getAnswerNode(identifiers).toTex();
+};
+const getHint = (identifiers) => {
+    const { strGroupBy, nodeIdsDataClass } = identifiers;
+    const nodeDataClass = NodeConstructor.fromIdentifiers(nodeIdsDataClass);
+    return `Compte le nombre de points qui ont $${getTexCondition(strGroupBy, nodeDataClass)}$.`;
+};
+const getCorrection = (identifiers) => {
+    const { strGroupBy, nodeIdsDataClass } = identifiers;
+    const nodeDataClass = NodeConstructor.fromIdentifiers(nodeIdsDataClass);
+    return `On compte le nombre de points qui ont $${getTexCondition(strGroupBy, nodeDataClass)}$.
+
+Il y en a $${getAnswer(identifiers)}$.
+`;
+};
+const getCorrectionGGBOptions = (identifiers) => {
+    const { pointIds, strGroupBy, nodeIdsDataClass } = identifiers;
+    const arrPoint = pointIds.map((pointIds) => PointConstructor.fromIdentifiers(pointIds));
+    const nodeDataClass = NodeConstructor.fromIdentifiers(nodeIdsDataClass);
+    const [arrPointFiltered, arrPointDropped] = arrPoint.reduce((acc, point) => {
+        const nodeComponent = getComponentOfPointForStrGroupBy(point, strGroupBy);
+        if (nodeDataClass.includes(nodeComponent)) {
+            acc[0].push(point);
+        }
+        else {
+            acc[1].push(point);
+        }
+        return acc;
+    }, [[], []]);
+    const commands = [
+        ...[arrPointFiltered, arrPointDropped].flatMap((arrPoint, i) => arrPoint.flatMap((point) => point.toGGBCommand({
+            isFixed: true,
+            isSelectionnable: true,
+            showLabel: false,
+            size: 6,
+            style: 3,
+            color: i % 2 === 0 ? greenMain : "#000000",
+        }))),
+        ...(() => {
+            switch (strGroupBy) {
+                case "x":
+                    return [nodeDataClass].flatMap((nodeInterval, i) => {
+                        return [
+                            ...(() => {
+                                const value = nodeInterval.a.evaluate();
+                                return [
+                                    `l${i}l = Line((${value}, 0),(${value}, 1))`,
+                                    `SetColor(l${i}l, "${(() => {
+                                        switch (nodeInterval.closure) {
+                                            case ClosureType.FF:
+                                            case ClosureType.FO:
+                                                return orange;
+                                            case ClosureType.OF:
+                                            case ClosureType.OO:
+                                                return red;
+                                        }
+                                    })()}")`,
+                                ];
+                            })(),
+                            ...(() => {
+                                const value = nodeInterval.b.evaluate();
+                                return [
+                                    `l${i}h = Line((${value}, 0),(${value}, 1))`,
+                                    `SetColor(l${i}h, "${(() => {
+                                        switch (nodeInterval.closure) {
+                                            case ClosureType.FF:
+                                            case ClosureType.OF:
+                                                return orange;
+                                            case ClosureType.FO:
+                                            case ClosureType.OO:
+                                                return red;
+                                        }
+                                    })()}")`,
+                                ];
+                            })(),
+                        ];
+                    });
+                case "y":
+                    return [nodeDataClass].flatMap((nodeInterval, i) => {
+                        return [
+                            ...(() => {
+                                const value = nodeInterval.a.evaluate();
+                                return [
+                                    `l${i}l = Line((0, ${value}),(1,${value}))`,
+                                    `SetColor(l${i}l, "${(() => {
+                                        switch (nodeInterval.closure) {
+                                            case ClosureType.FF:
+                                            case ClosureType.FO:
+                                                return orange;
+                                            case ClosureType.OF:
+                                            case ClosureType.OO:
+                                                return red;
+                                        }
+                                    })()}")`,
+                                ];
+                            })(),
+                            ...(() => {
+                                const value = nodeInterval.b.evaluate();
+                                return [
+                                    `l${i}h = Line((0, ${value}),(1,${value}))`,
+                                    `SetColor(l${i}h, "${(() => {
+                                        switch (nodeInterval.closure) {
+                                            case ClosureType.FF:
+                                            case ClosureType.OF:
+                                                return orange;
+                                            case ClosureType.FO:
+                                            case ClosureType.OO:
+                                                return red;
+                                        }
+                                    })()}")`,
+                                ];
+                            })(),
+                        ];
+                    });
+                default:
+                    throw new Error("Unsupported strGroupBy: " + strGroupBy);
+            }
+        })(),
+    ];
+    const ggb = new GeogebraConstructor({
+        commands,
+        hideGrid: true,
+        fontSize: 16,
+        xAxis: {
+            showPositive: true,
+            label: "x",
+            steps: 1,
+        },
+        yAxis: {
+            showPositive: true,
+            label: "y",
+            steps: 1,
+        },
+    });
+    return ggb.getOptions({
+        coords: ggb.getAdaptedCoords({
+            xMin: -1,
+            xMax: 6,
+            yMin: -1,
+            yMax: 6,
+        }),
+    });
+};
+const getGGBOptions = (identifiers) => {
+    const { pointIds } = identifiers;
+    const arrPoint = pointIds.map((pointIds) => PointConstructor.fromIdentifiers(pointIds));
+    const commands = [
+        ...arrPoint.flatMap((point) => point.toGGBCommand({
+            isFixed: true,
+            isSelectionnable: true,
+            showLabel: false,
+            size: 5,
+            style: 3,
+        })),
+    ];
+    const ggb = new GeogebraConstructor({
+        commands,
+        hideGrid: false,
+        fontSize: 16,
+        xAxis: {
+            showPositive: true,
+            label: "x",
+            steps: 1,
+        },
+        yAxis: {
+            showPositive: true,
+            label: "y",
+            steps: 1,
+        },
+    });
+    return ggb.getOptions({
+        coords: ggb.getAdaptedCoords({
+            xMin: -1,
+            xMax: 6,
+            yMin: -1,
+            yMax: 6,
+        }),
+    });
+};
+const getPropositions = (n, { answer, ...identifiers }) => {
+    const { strGroupBy, nodeIdsDataClass } = identifiers;
+    const nodeDataClass = NodeConstructor.fromIdentifiers(nodeIdsDataClass);
+    const propositions = [];
+    addValidProp(propositions, answer);
+    const arrTerror = [answer];
+    //student: wrong groupBy
+    {
+        const identifiersWrong = {
+            ...identifiers,
+            strGroupBy: strGroupBy === "x" ? "y" : "x",
+        };
+        const texWrong = getAnswer(identifiersWrong);
+        tryToAddWrongProp(propositions, texWrong);
+        arrTerror.push(texWrong);
+    }
+    //student: wrong closure
+    {
+        [ClosureType.FF, ClosureType.FO, ClosureType.OF].forEach((closure) => {
+            const nodeDataClassWrong = new IntervalNode(nodeDataClass.a, nodeDataClass.b, closure);
+            const identifiersWrong = {
+                ...identifiers,
+                nodeIdsDataClass: nodeDataClassWrong.toIdentifiers(),
+            };
+            const texWrong = getAnswer(identifiersWrong);
+            tryToAddWrongProp(propositions, texWrong);
+            arrTerror.push(texWrong);
+        });
+    }
+    //filler
+    {
+        propWhile(propositions, n, () => {
+            const vTerrorTarget = parseInt(random(arrTerror));
+            const vTerrorAround = vTerrorTarget + randint(-5, 5);
+            if (vTerrorAround >= 0) {
+                tryToAddWrongProp(propositions, vTerrorAround.frenchify());
+            }
+        });
+    }
+    return shuffleProps(propositions, n);
+};
+const getKeys = () => {
+    return [];
+};
+const isAnswerValid = (ans, { answer }) => {
+    return numberVEA(ans, answer);
+};
+const getScatterPlotInterpretingQuestion = () => {
+    const length = 6;
+    const height = 6;
+    const arrArrDict1 = getCartesiansProducts([
+        [...Array(length).keys()].map((i) => i + 1),
+        [...Array(height).keys()].map((i) => i + 1),
+    ]).map(([x, y]) => {
+        return {
+            x,
+            y,
+            isActivated: probaFlip(0.14),
+        };
+    });
+    const arrArrDict2 = getCartesiansProducts([
+        [...Array(length - 1).keys()].map((i) => i + 1),
+        [...Array(height - 1).keys()].map((i) => i + 1),
+    ]).map(([x, y]) => {
+        return {
+            x: x + 0.333,
+            y: y + 0.333,
+            isActivated: probaFlip(0.14),
+        };
+    });
+    const arrArrDict3 = getCartesiansProducts([
+        [...Array(length - 1).keys()].map((i) => i + 1),
+        [...Array(height - 1).keys()].map((i) => i + 1),
+    ]).map(([x, y]) => {
+        return {
+            x: x + 0.666,
+            y: y + 0.666,
+            isActivated: probaFlip(0.14),
+        };
+    });
+    //at least one point should be activated
+    {
+        const dictRandom = random(arrArrDict1);
+        dictRandom.isActivated = true;
+    }
+    const arrPoint = [...arrArrDict1, ...arrArrDict2, ...arrArrDict3]
+        .filter(({ isActivated }) => isActivated)
+        .map(({ x, y }, i) => new Point(`P${i}`, x, y));
+    const strGroupBy = coinFlip() ? "x" : "y";
+    const nodeDataClass = (() => {
+        if (coinFlip()) {
+            const nodeV = randint(1, 1 + length).toTree();
+            return new IntervalNode(nodeV, nodeV, ClosureType.FF);
+        }
+        else {
+            const templateArrLengthDataClass = probaLawFlip([
+                [[1, 1, 1, 2], 0.2],
+                [[1, 2, 2], 0.4],
+                [[1, 1, 3], 0.3],
+                [[2, 3], 0.1],
+            ]);
+            const arrLengthDataClass = shuffle(templateArrLengthDataClass);
+            const arrDataClass = arrLengthDataClass.reduce((acc, lengthDataClass) => {
+                const nodeBoundLow = acc.nodeBoundLowWork;
+                const nodeBoundHigh = add(nodeBoundLow, lengthDataClass).simplify({
+                    towardsDistribute: true,
+                });
+                const closure = random([
+                    ClosureType.FF,
+                    ClosureType.FO,
+                    ClosureType.OF,
+                ]);
+                const nodeDataClass = new IntervalNode(nodeBoundLow, nodeBoundHigh, closure);
+                acc.dataClasses.push(nodeDataClass);
+                acc.nodeBoundLowWork = nodeBoundHigh;
+                return acc;
+            }, {
+                nodeBoundLowWork: (1).toTree(),
+                dataClasses: [],
+            }).dataClasses;
+            return random(arrDataClass);
+        }
+    })();
+    const identifiers = {
+        pointIds: arrPoint.map((point) => point.toIdentifiers()),
+        strGroupBy,
+        nodeIdsDataClass: nodeDataClass.toIdentifiers(),
+    };
+    return getQuestionFromIdentifiers(identifiers);
+};
+const getQuestionFromIdentifiers = (identifiers) => {
+    return {
+        instruction: getInstruction(identifiers),
+        answer: getAnswer(identifiers),
+        answerFormat: "tex",
+        keys: getKeys(identifiers),
+        identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
+        correctionGgbOptions: getCorrectionGGBOptions(identifiers),
+        ggbOptions: getGGBOptions(identifiers),
+    };
+};
+export const scatterPlotInterpreting = {
+    id: "scatterPlotInterpreting",
+    label: "Interpréter un nuage de points",
+    isSingleStep: true,
+    generator: (nb, opts) => getDistinctQuestions(() => getScatterPlotInterpretingQuestion(opts), nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    subject: "Mathématiques",
+    getAnswer,
+    isAnswerValid,
+    getPropositions,
+    getInstruction,
+    getGGBOptions,
+    hasGeogebra: true,
+    getQuestionFromIdentifiers,
+    getHint,
+    getCorrection,
+    hasHintAndCorrection: true,
+};

package/lib/exercises/math/dataRepresentations/tables/buildDoubleTableFromContext.d.ts

@@ -0,0 +1,7 @@
+import { Exercise } from "../../../../exercises/exercise.js";
+type Identifiers = {
+    coeffs: (number | undefined)[][];
+};
+export declare const buildDoubleTableFromContext: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=buildDoubleTableFromContext.d.ts.map

package/lib/exercises/math/dataRepresentations/tables/buildDoubleTableFromContext.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"buildDoubleTableFromContext.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/dataRepresentations/tables/buildDoubleTableFromContext.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,6BAA6B,CAAC;AAWrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,EAAE,CAAC;CAClC,CAAC;AA0NF,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,WAAW,CAoB7D,CAAC"}

package/lib/exercises/math/dataRepresentations/tables/buildDoubleTableFromContext.js

@@ -0,0 +1,222 @@
+import { getDistinctQuestions } from "../../../../exercises/utils/getDistinctQuestions.js";
+import { valueTableVEA } from "../../../../exercises/vea/valueTableVEA.js";
+import { randTupleInt } from "../../../../math/utils/random/randTupleInt.js";
+import { handleVEAError } from "../../../../utils/errors/handleVEAError.js";
+import { dollarize } from "../../../../utils/latex/dollarize.js";
+import { mdTable } from "../../../../utils/markdown/mdTable.js";
+const getAnswerTable = (identifiers) => {
+    const { coeffs } = identifiers;
+    let done = false;
+    let counter = 1;
+    const rightCoeffs = coeffs.map((e) => [...e]);
+    while (!done && counter < 1000) {
+        counter++;
+        if (counter > 1000)
+            throw new Error("Too many iterations in fillDoubleTable");
+        // console.log(rightCoeffs);
+        for (let i = 0; i < 9; i++) {
+            const cellLine = Math.floor(i / 3);
+            const cellColumn = i % 3;
+            const cell = rightCoeffs[cellLine][cellColumn];
+            if (cell)
+                continue;
+            const isLineCalculable = rightCoeffs[cellLine].filter((e) => !!e).length === 2;
+            if (isLineCalculable) {
+                //si total ligne
+                if ((cellColumn + 1) % 3 === 0)
+                    rightCoeffs[cellLine][cellColumn] = rightCoeffs[cellLine]
+                        .filter((e) => !!e)
+                        .reduce((acc, e) => acc + e, 0);
+                else
+                    rightCoeffs[cellLine][cellColumn] =
+                        rightCoeffs[cellLine][2] -
+                            (rightCoeffs[cellLine][0] ?? rightCoeffs[cellLine][1]);
+            }
+            const isColCalculable = rightCoeffs[(cellLine + 1) % 3][cellColumn] &&
+                rightCoeffs[(cellLine + 2) % 3][cellColumn];
+            if (isColCalculable) {
+                const prev = rightCoeffs[(cellLine + 1) % 3][cellColumn];
+                const next = rightCoeffs[(cellLine + 2) % 3][cellColumn];
+                //si total colomne
+                if (cellLine === 2)
+                    rightCoeffs[cellLine][cellColumn] = prev + next;
+                else
+                    rightCoeffs[cellLine][cellColumn] =
+                        rightCoeffs[2][cellColumn] -
+                            rightCoeffs[1 - cellLine][cellColumn];
+            }
+        }
+        done = rightCoeffs.every((line) => line.every((a) => a !== undefined));
+    }
+    return [
+        [" ", "Hommes", "Femmes", "Total"],
+        ["Plus de $40$ ans", ...rightCoeffs[0].map((e) => e.frenchify())],
+        ["Moins de $40$ ans", ...rightCoeffs[1].map((e) => e.frenchify())],
+        ["Total", ...rightCoeffs[2].map((e) => e.frenchify())],
+    ];
+};
+const getInstruction = (identifiers) => {
+    const { coeffs } = identifiers;
+    const strings = [
+        [
+            "hommes de plus de $40$ ans",
+            "femmes de plus de $40$ ans",
+            "employés de plus de $40$ ans",
+        ],
+        [
+            "hommes de moins de $40$ ans",
+            "femmes de moins de $40$ ans",
+            "employés de moins de $40$ ans",
+        ],
+        ["hommes", "femmes", "employés"],
+    ];
+    const givenStrings = [];
+    for (let i = 0; i < coeffs.length; i++) {
+        for (let j = 0; j < coeffs[i].length; j++) {
+            if (coeffs[i][j] !== undefined)
+                givenStrings.push(`$${coeffs[i][j]}$ ${strings[i][j]}`);
+        }
+    }
+    return `Dans une entreprise, il y a : 
+  
+- ${givenStrings[0]};
+
+- ${givenStrings[1]};
+
+- ${givenStrings[2]};
+
+- ${givenStrings[3]}.
+
+Compléter le tableau croisé d'effectifs ci-dessous pour décrire la répartition des employés de l'entreprise.`;
+};
+const getHint = () => {
+    return `Commence par remplir les cases que l'on peut déterminer grâce aux données de l'énoncé.
+  
+Puis, détermine les cases manquantes en faisant des additions ou des soustractions.`;
+};
+const getCorrection = (identifiers) => {
+    const { coeffs } = identifiers;
+    const ansTable = getAnswerTable(identifiers);
+    const dollarized = ansTable.map((e, i) => i === 0 ? e : [e[0], ...e.slice(1).map((e) => dollarize(e))]);
+    return `On commence par remplir les cases que l'on peut déterminer grâce aux données de l'énoncé :
+  
+${mdTable([
+        [" ", "Hommes", "Femmes", "Total"],
+        [
+            "Plus de $40$ ans",
+            ...coeffs[0].map((e) => (e ? dollarize(e.frenchify()) : "")),
+        ],
+        [
+            "Moins de $40$ ans",
+            ...coeffs[1].map((e) => (e ? dollarize(e.frenchify()) : "")),
+        ],
+        ["Total", ...coeffs[2].map((e) => (e ? dollarize(e.frenchify()) : ""))],
+    ])}
+
+Puis, on complète les cases manquantes : 
+
+${mdTable(dollarized)}`;
+};
+const getKeys = () => {
+    return [];
+};
+const isAnswerTableValid = (ans, { answerTable }) => {
+    try {
+        return valueTableVEA(ans, answerTable);
+    }
+    catch (err) {
+        return handleVEAError(err);
+    }
+};
+function rank(vectors) {
+    const basis = [];
+    for (let v of vectors) {
+        for (const b of basis) {
+            v = Math.min(v, v ^ b); // réduction
+        }
+        if (v !== 0)
+            basis.push(v);
+    }
+    return basis.length;
+}
+const getBuildDoubleTableFromContextQuestion = () => {
+    const [a, b, c, d] = randTupleInt(4, {
+        from: 1,
+        to: 100,
+    });
+    //on calcule le rang de 4 vecteurs ci-dessous pris au hasard, si linéairement indépendants alors le tableau est remplissable
+    const vecs = [
+        [1, 0, 0, 0], //A1
+        [0, 1, 0, 0], //A2
+        [1, 1, 0, 0], //TA
+        [0, 0, 1, 0], //B1
+        [0, 0, 0, 1], //B2
+        [0, 0, 1, 1], //TB
+        [1, 0, 1, 0], //T1
+        [0, 1, 0, 1], //T2
+        [1, 1, 1, 1], //T
+    ];
+    const coeffs = [
+        [a, b, a + b],
+        [c, d, c + d],
+        [a + c, b + d, a + b + c + d],
+    ];
+    let choices = [];
+    do {
+        choices = randTupleInt(4, {
+            from: 0,
+            to: vecs.length,
+            allDifferent: true,
+        });
+    } while (rank(choices.map((i) => parseInt(vecs[i].join(""), 2))) !== 4);
+    for (let i = 0; i < 9; i++) {
+        if (choices.includes(i))
+            continue;
+        coeffs[Math.floor(i / 3)][i % 3] = undefined;
+    }
+    const identifiers = {
+        coeffs,
+    };
+    return getQuestionFromIdentifiers(identifiers);
+};
+const getQuestionFromIdentifiers = (identifiers) => {
+    return {
+        answerTable: getAnswerTable(identifiers),
+        instruction: getInstruction(identifiers),
+        keys: getKeys(identifiers),
+        answerFormat: "tex",
+        identifiers,
+        hint: getHint(identifiers),
+        correction: getCorrection(identifiers),
+        initTable: [
+            [" ", "Hommes", "Femmes", "Total"],
+            ["Plus de $40$ ans", "", "", ""],
+            ["Moins de $40$ ans", "", "", ""],
+            ["Total", "", "", ""],
+        ],
+        style: {
+            tableOptions: {
+                firstColumnIsHeader: true,
+                firstCellIsDivided: false,
+                firstRowIsHeader: true,
+            },
+        },
+    };
+};
+export const buildDoubleTableFromContext = {
+    id: "buildDoubleTableFromContext",
+    label: "Construire un tableau croisé d'effectifs à partir d'un contexte",
+    isSingleStep: true,
+    generator: (nb, opts) => getDistinctQuestions(() => getBuildDoubleTableFromContextQuestion(opts), nb),
+    qcmTimer: 60,
+    freeTimer: 60,
+    isAnswerTableValid,
+    subject: "Mathématiques",
+    getInstruction,
+    getHint,
+    getCorrection,
+    getAnswerTable,
+    getQuestionFromIdentifiers,
+    hasHintAndCorrection: true,
+    answerType: "valueTable",
+};

package/lib/exercises/math/dataRepresentations/tables/fillDoubleTable.d.ts

@@ -0,0 +1,7 @@
+import { Exercise } from "../../../../exercises/exercise.js";
+type Identifiers = {
+    coeffs: (number | undefined)[][];
+};
+export declare const fillDoubleTable: Exercise<Identifiers>;
+export {};
+//# sourceMappingURL=fillDoubleTable.d.ts.map

package/lib/exercises/math/dataRepresentations/tables/fillDoubleTable.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fillDoubleTable.d.ts","sourceRoot":"","sources":["../../../../../src/exercises/math/dataRepresentations/tables/fillDoubleTable.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,QAAQ,EAST,MAAM,6BAA6B,CAAC;AAYrC,KAAK,WAAW,GAAG;IACjB,MAAM,EAAE,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,EAAE,CAAC;CAClC,CAAC;AAqLF,eAAO,MAAM,eAAe,EAAE,QAAQ,CAAC,WAAW,CAiBjD,CAAC"}