SICP 练习2.40 unique-pairs

关注

原创最新推荐文章于 2026-06-18 11:39:03 发布 550 阅读 AI 写同款· GEO 优化 ›

多Agent协作编程实战：五位AI程序员如何重塑Java开发流程从AI编程助手到AI程序员，技术范式正在发生深刻转变。早期工具仅能补全代码，而基于大语言模型的多Agent架构，通过拆分任务、分工协作，实现了从需求分析到测试修复的自动化闭环。其核心原理在于将复杂工程拆解为多个专业角色，如架构、编码、测试、审查与修复，各Agent通过结构化产物交互，既突破了单模型上下文限制，又以机制化方式保障代码质量。这种模式不仅提升了长任务稳定性与调试效率，也为Java程序员提供了崭新的学习路径——借助多Agent系统模拟真实团队协作，进行知识构建、代码评审与项目实训。本文以Orca为例阅读详情

我所做的只是把unique-pairs封装了一下

(define (accumulate op initial sequence)
  (if (null? sequence)
    initial
    (op (car sequence)
        (accumulate op initial (cdr sequence)))))

(define (enumerate-interval low high)
  (if (> low high) '() (cons low (enumerate-interval (+ low 1) high))))

(define (fliter predicate sequence)
  (cond ((null? sequence) '())
        ((predicate (car sequence))
         (cons (car sequence) (fliter predicate (cdr sequence))))
        (else (fliter predicate (cdr sequence)))))

(define (flatmap proc seq)
  (accumulate append '() (map proc seq)))

(define (unique-pairs n)
  (flatmap (lambda (i)
             (map (lambda (j) (list i j))
                    (enumerate-interval 1 (- i 1))))
           (enumerate-interval 1 n)))

(define (prime-sum? pair)
  (prime? (+ (car pair) (cadr pair))))

(define (make-pair-sum pair)
  (list (car pair) (cadr pair) (+ (car pair) (cadr pair))))

(define (smallest-divisor n)
  (find-divisor n 2))

(define (find-divisor n test-divisor)
  (cond ((> (square test-divisor) n) n)
        ((divides? test-divisor n) test-divisor)
        (else (find-divisor n (+ test-divisor 1)))))

(define (divides? a b)
  (= (remainder b a) 0))

(define (prime? n)
  (= n (smallest-divisor n)))

(define (prime-sum-pairs n)
  (map make-pair-sum
       (fliter prime-sum? (unique-pairs n))))

(newline)
(display (prime-sum-pairs 6))