{
  "context": "Evaluates whether the implementation leans on prelude-ls number helpers to deliver gcd/lcm plus contrasting truncated and floored division results. Checks that solutions rely on the provided numeric helpers instead of recreating arithmetic and honor the differing quotient/remainder semantics.",
  "type": "weighted_checklist",
  "checklist": [
    {
      "name": "GCD helper",
      "description": "greatestCommonDivisor delegates to prelude-ls gcd (Num.gcd or the root export) to normalize sign and handle zero inputs instead of hand-written loops.",
      "max_score": 25
    },
    {
      "name": "LCM helper",
      "description": "leastCommonMultiple uses prelude-ls lcm (Num.lcm or root export) to guarantee non-negative results, avoiding custom multiplication/gcd logic.",
      "max_score": 25
    },
    {
      "name": "Truncated division",
      "description": "truncatedDivision computes quotient with prelude-ls quot (truncates toward zero) and remainder with prelude-ls mod to mirror JavaScript-sign remainders rather than manual Math.trunc or bespoke modulo math.",
      "max_score": 25
    },
    {
      "name": "Floored division",
      "description": "flooredDivision uses prelude-ls div for the floor-style quotient and derives the modulus from that quotient (e.g., dividend - divisor * div(...)) to ensure the modulus follows the divisor’s sign, not from truncation or raw %.",
      "max_score": 25
    }
  ]
}