ND
Size: a a a
ND
TT
ND
ND
TT
ND
ND
TT
ND
a
(define (max lst)
(fold (lambda (acc v) (if (> v acc) v acc)) 0 lst))
(fold (lambda (acc v)
(if (> v (car acc))
(list v (car acc))
(if (> v (cadr acc))
(list (car acc) v)
acc)))
'(0 0)
lst
)y
(max (min a b) (min b c) (min a c))
должно сработать.a
ND
ND
T
TT
(fold (lambda (acc v)
(if (> v (car acc))
(list v (car acc))
(if (> v (cadr acc))
(list (car acc) v)
acc)))
'(0 0)
lst
)#lang racket
(require srfi/1)
(define (max lst)
(fold (lambda (acc v)
(if (> v (car acc))
(list v (car acc))
(if (> v (cadr acc))
(list (car acc) v)
acc)))
'(0 0)
lst))
(define lst (list first second third))
(define (sum-of-squares-of-top-two first second third) (+ (sqr (max lst)) (sqr (max (delete (max lst) lst)))))
(sum-of-squares-of-top-two 2 3 1)
car: contract violation
expected: pair?
given: #<procedure:car>
a
#lang racket
(require srfi/1)
(define (max lst)
(fold (lambda (acc v)
(if (> v (car acc))
(list v (car acc))
(if (> v (cadr acc))
(list (car acc) v)
acc)))
'(0 0)
lst))
(define lst (list first second third))
(define (sum-of-squares-of-top-two first second third) (+ (sqr (max lst)) (sqr (max (delete (max lst) lst)))))
(sum-of-squares-of-top-two 2 3 1)
car: contract violation
expected: pair?
given: #<procedure:car>
TT
a
(apply + (map sqr (max lst)))
, наверное