1. Список говнокодов пользователя zura

    Всего: 1

  2. Куча / Говнокод #7002

    +131

    1. 01
    2. 02
    3. 03
    4. 04
    5. 05
    6. 06
    7. 07
    8. 08
    9. 09
    10. 10
    11. 11
    12. 12
    13. 13
    14. 14
    15. 15
    16. 16
    17. 17
    18. 18
    19. 19
    20. 20
    21. 21
    22. 22
    23. 23
    24. 24
    25. 25
    26. 26
    27. 27
    28. 28
    29. 29
    30. 30
    31. 31
    32. 32
    33. 33
    34. 34
    35. 35
    36. 36
    37. 37
    38. 38
    39. 39
    40. 40
    41. 41
    42. 42
    43. 43
    44. 44
    45. 45
    46. 46
    47. 47
    48. 48
    49. 49
    50. 50
    51. 51
    52. 52
    53. 53
    54. 54
    55. 55
    56. 56
    57. 57
    58. 58
    59. 59
    60. 60
    61. 61
    62. 62
    63. 63
    64. 64
    65. 65
    66. 66
    67. 67
    68. 68
    69. 69
    70. 70
    71. 71
    72. 72
    73. 73
    74. 74
    75. 75
    76. 76
    77. 77
    78. 78
    79. 79
    (defparameter n 2)
(setf middle (make-array 2 :initial-element 0))
(defparameter v 7)
(setf tr (make-array `(,(+ 1 n) ,n) :initial-element 4))
(setf ftr (make-array 3 :initial-element 1))
(defun pow (x n)
(cond((= n 0) 1)((= n 1) x)(T (* x (pow x (- n 1))))))
(defun f1 (x y)
(+ (* (pow v 2) (pow x 2))
(* (/ v (+ v 1)) x)
(* 15 (+ v 1) (pow y 2))
(* -1 2 v y) (* 4 v)))

(defun sigma1 (a)
(* a (/ (+ (sqrt (+ n 1)) (- n 1))
(* n (sqrt 2))) ))

(defun sigma2 (a)
(* a (/ (+ (sqrt (+ n 1)) -1)
(* n (sqrt 2))) ))

(defun setp (a)
(loop for i from 1 to n do
(loop for j from 0 to (- n 1) do
(cond
((= (- i 1) j) (setf (aref tr i j) (+ (aref tr 0 0) (sigma2 a))))
(T (setf (aref tr i j) (+ (aref tr 0 1) (sigma1 a))))))))

(defun evalfun ()
(loop for i from 0 to n do
(setf (aref ftr i) (f1 (aref tr i '0) (aref tr i '1)))
(format t "The functions in dot ~$:~$~$" `(,(aref tr i '0) ,(aref tr i '1)) (aref ftr i) #\newline))
(setf ftr (sort ftr #'<)))

(defun midp()
(loop for i from 0 to n do
(cond
((= (aref ftr n) (f1 (aref tr i '0) (aref tr i '1)))
(setq tp i))))

(setf middle (make-array n :initial-element 0))
(loop for i from 0 to n do
(cond
((/= i tp)
(setf (aref middle 0) (+ (aref middle 0) (aref tr i 0)))
(setf (aref middle 1) (+ (aref middle 1) (aref tr i 1))))))
(setf (aref middle 1) (/ (aref middle 1) 2))
(setf (aref middle 0) (/ (aref middle 0) 2))
(format t "The weight center in ~$,~$" (aref middle 0) (aref middle 0))
(princ #\newline))

(defun newp()
(setf (aref tr tp 0) (- (aref middle 0) (aref tr tp 0)))
(setf (aref tr tp 1) (- (aref middle 1) (aref tr tp 1))))
(defun prpolinom()
(format t "Polinom has this dots:~$" #\newline)
(loop for i to n do
(loop for j to (- n 1) do
(format t "|~$|" (aref tr i j)))
(princ #\newline)))

(setq c 1)
(defun mloop(a)
(setp a)
(defun subloop()
(setq c (+ c 1))
(setf tmiddle (make-array n :initial-element 0))
(loop for i to (- n 1) do
(setf (aref tmiddle i) (aref middle i)))
(evalfun)
(midp)
(newp)
(prpolinom)

(cond
((and (= (aref tmiddle 0) (aref middle 0)) (= (aref tmiddle 1) (aref middle 1)))(mloop (/ a 2)))
((> a 0.01) (subloop) (format t "Iteration ~$~$" c #\newline))))
(subloop))
(mloop 2)

    симплекс метод на Common Lisp=)

    zura, 20 Июня 2011

    Комментарии (24)