- perf-validation.md:五实验协议/判据/材料(2026-09-23 自设计) - perf-validation-report-2026-09-23.md:汇总报告(判据逐项对照 + 诚实结论) - tests/blind_experiment.rs + tests/blind/:盲测 harness(查询通道/修复回路/usage 计量)+ 冻结材料(6 任务书 + docs-bundle) - tests/contract_ablation.rs:四边界×三情形消融(拦截 100%/误报 0%/零回归) - tests/drift_drill.rs:9 漂移必报 + 2 负对照 - src/mlsp.rs:syntax 卡片自持化(semantics/rule/sample/doc_quote) - three-problems.md §5.1 判据矩阵逐行判定(问题 1✅ 2✅ 3❌);three-problems-plan.md Phase 4 落地记录 - 全量干净回归零失败 Co-authored-by: Cursor <cursoragent@cursor.com>
725 B
725 B
Task: qb_get_factors (hard) — Prime Factorization
Implement prime factorization as a function named get_factors in a Marqdo .mq.md program. The function takes an integer n ≥ 2 and returns its prime factors in ascending order.
Requirements
- Function name
get_factors. - In
# main, hardcode the demo inputs below and print each result on its own line — factors joined by*with no spaces, exactly three lines, no labels.
Demo inputs (hardcode)
121360
Expected output (self-check)
Three lines:
2*2*3
13
2*2*3*5
Deliverable
Write the program as a Marqdo .mq.md file. Return the complete source in a single ```markdown fence — no prose outside the fence.