Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Project Euler Problem 137
;gnu clisp 2.49 (let ((barning-matrixes '(((1 -2 2) (2 -1 2) (2 -2 3)) ((1 2 2) (2 1 2) (2 2 3)) ((-1 2 2) (-2 1 2) (-2 2 3)))) (sum 0)) (defun test-triangle (sides) (zerop (rem (caddr sides) (- (cadr sides) (car sides))))) (defun sum-tiles (sides &aux (perimeter (reduce #'+ sides))) (if (> 100000000 perimeter) (progn (if (zerop (rem (caddr sides) (- (cadr sides) (car sides)))) (incf sum)) (loop for i in barning-matrixes for branch = (loop for rows in i collect (reduce #'+ (mapcar #'* rows sides))) do (sum-tiles (sort branch #'<)))))) (pprint (sum-tiles '(3 4 5))) (pprint sum) )
run
|
edit
|
history
|
help
0
LISP Quick Lab
Homework.Lisp
prunik a sjednoceni
LISP Quick Lab
title2
45
A2-Q1
Handong Global University
L1.8a
sw