Skip to content

Commit 6a66019

Browse files
deniscostadscdeniscostadsc
committed
Fix lint
1 parent 108faf9 commit 6a66019

File tree

7 files changed

+89
-92
lines changed

7 files changed

+89
-92
lines changed

‎solutions/beecrowd/1002/1002.clj

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,6 @@
22

33
(defn main []
44
(let [n (Double/parseDouble (read-line))]
5-
(format "%.4f" (* (* n n) 3.14159))))
5+
(format "%.4f" (* n n 3.14159))))
66

77
(printf "A=%s%n" (main))

‎solutions/beecrowd/1011/1011.clj

+1-2
Original file line numberDiff line numberDiff line change
@@ -8,8 +8,7 @@
88
(let [radius (Double/parseDouble line)]
99
(printf "VOLUME = %.3f%n"
1010
(-> (/ 4.0 3.0)
11-
(* pi)
12-
(* (Math/pow radius 3)))))
11+
(* pi (Math/pow radius 3)))))
1312
(recur (read-line)))))
1413

1514
(main)

‎solutions/beecrowd/1012/1012.clj

+1-1
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@
1111
b' (Double/parseDouble b)
1212
c' (Double/parseDouble c)]
1313
(printf "TRIANGULO: %.3f%n" (/ (* a' c') 2))
14-
(printf "CIRCULO: %.3f%n" (* pi (* c' c')))
14+
(printf "CIRCULO: %.3f%n" (* pi c' c'))
1515
(printf "TRAPEZIO: %.3f%n" (* (/ (+ a' b') 2) c'))
1616
(printf "QUADRADO: %.3f%n" (* b' b'))
1717
(printf "RETANGULO: %.3f%n" (* a' b')))

‎solutions/beecrowd/1013/1013.clj

+2-3
Original file line numberDiff line numberDiff line change
@@ -5,9 +5,8 @@
55
[a b]
66
(-> (- a b)
77
Math/abs
8-
(+ b)
9-
(+ a)
10-
(/ 2)))
8+
(+ b a)
9+
(/ 2)))
1110

1211
(defn main []
1312
(loop [line (read-line)]

‎solutions/beecrowd/1032/1032.clj

+82-82
Original file line numberDiff line numberDiff line change
@@ -1,95 +1,95 @@
1-
(ns main)
1+
;; (ns main)
22

3-
(defn divisible? [number divisor]
4-
(zero? (rem number divisor)))
3+
;; (defn divisible? [number divisor]
4+
;; (zero? (rem number divisor)))
55

6-
(def prime?
7-
(memoize (fn [number]
8-
(cond (= number 2)
9-
true
10-
(or (< number 2) (divisible? number 2))
11-
false
12-
:else
13-
(not-any? #(divisible? number %) (range
14-
3
15-
(-> (Math/sqrt number)
16-
Math/ceil
17-
int
18-
inc)
19-
2))))))
6+
;; (def prime?
7+
;; (memoize (fn [number]
8+
;; (cond (= number 2)
9+
;; true
10+
;; (or (< number 2) (divisible? number 2))
11+
;; false
12+
;; :else
13+
;; (not-any? #(divisible? number %) (range
14+
;; 3
15+
;; (-> (Math/sqrt number)
16+
;; Math/ceil
17+
;; int
18+
;; inc)
19+
;; 2))))))
2020

21-
(def next-prime
22-
(memoize (fn [number]
23-
(let [next-number (inc number)]
24-
(if (prime? next-number)
25-
next-number
26-
(next-prime (inc number)))))))
21+
;; (def next-prime
22+
;; (memoize (fn [number]
23+
;; (let [next-number (inc number)]
24+
;; (if (prime? next-number)
25+
;; next-number
26+
;; (next-prime (inc number)))))))
2727

28-
(def nth-prime
29-
(memoize (fn [nth]
30-
(loop [index 0
31-
prime 2]
32-
(cond (= nth 0)
33-
2
34-
(= index (dec nth))
35-
(next-prime prime)
36-
:else
37-
(recur (inc index)
38-
(next-prime prime)))))))
28+
;; (def nth-prime
29+
;; (memoize (fn [nth]
30+
;; (loop [index 0
31+
;; prime 2]
32+
;; (cond (= nth 0)
33+
;; 2
34+
;; (= index (dec nth))
35+
;; (next-prime prime)
36+
;; :else
37+
;; (recur (inc index)
38+
;; (next-prime prime)))))))
3939

40-
;; (def josephus
41-
;; (memoize (fn [n k]
42-
;; (if (= n 1)
43-
;; 1
44-
;; (-> (josephus (dec n) (next-prime k))
45-
;; (+ k)
46-
;; (dec)
47-
;; (mod n)
48-
;; (inc))))))
40+
;; ;; (def josephus
41+
;; ;; (memoize (fn [n k]
42+
;; ;; (if (= n 1)
43+
;; ;; 1
44+
;; ;; (-> (josephus (dec n) (next-prime k))
45+
;; ;; (+ k)
46+
;; ;; (dec)
47+
;; ;; (mod n)
48+
;; ;; (inc))))))
4949

50-
(defn josephus [n]
51-
(loop [current-n 1
52-
;; index-prime 0
53-
result 1]
54-
(printf "prime: %d > %d%n" (- n current-n) (nth-prime (- n current-n)))
55-
(printf "current-n: %d%n" current-n)
56-
(printf "result: %d%n" result)
57-
(printf "--%n")
58-
(cond (= n 1)
59-
1
60-
(= current-n (inc n))
61-
result
62-
:else
63-
(recur (inc current-n)
64-
;; (inc index-prime)
65-
(-> result
66-
(+ (nth-prime (- n current-n)))
67-
dec
68-
(mod current-n)
69-
inc))))
50+
;; (defn josephus [n]
51+
;; (loop [current-n 1
52+
;; ;; index-prime 0
53+
;; result 1]
54+
;; (printf "prime: %d > %d%n" (- n current-n) (nth-prime (- n current-n)))
55+
;; (printf "current-n: %d%n" current-n)
56+
;; (printf "result: %d%n" result)
57+
;; (printf "--%n")
58+
;; (cond (= n 1)
59+
;; 1
60+
;; (= current-n (inc n))
61+
;; result
62+
;; :else
63+
;; (recur (inc current-n)
64+
;; ;; (inc index-prime)
65+
;; (-> result
66+
;; (+ (nth-prime (- n current-n)))
67+
;; dec
68+
;; (mod current-n)
69+
;; inc))))
7070

71-
(defn main []
72-
(loop [number (Integer/parseInt (read-line))]
73-
(printf "-----------%n")
74-
(when (not= number 0)
75-
(printf "%d%n" (josephus number))
76-
(recur (Integer/parseInt (read-line))))))
71+
;; (defn main []
72+
;; (loop [number (Integer/parseInt (read-line))]
73+
;; (printf "-----------%n")
74+
;; (when (not= number 0)
75+
;; (printf "%d%n" (josephus number))
76+
;; (recur (Integer/parseInt (read-line))))))
7777

78-
(main)
78+
;; (main)
7979

80-
(defn print-primes []
81-
(loop [n 2]
82-
(when (<= n 200)
83-
(printf "%d -> %d%n" n (next-prime n))
84-
(recur (next-prime n)))))
80+
;; (defn print-primes []
81+
;; (loop [n 2]
82+
;; (when (<= n 200)
83+
;; (printf "%d -> %d%n" n (next-prime n))
84+
;; (recur (next-prime n)))))
8585

86-
;; (print-primes)
86+
;; ;; (print-primes)
8787

8888

89-
(defn print-nth-primes []
90-
(loop [n 0]
91-
(when (<= n 200)
92-
(printf "%d -> %d%n" n (nth-prime n))
93-
(recur (inc n)))))
89+
;; (defn print-nth-primes []
90+
;; (loop [n 0]
91+
;; (when (<= n 200)
92+
;; (printf "%d -> %d%n" n (nth-prime n))
93+
;; (recur (inc n)))))
9494

95-
;; (print-nth-primes)
95+
;; ;; (print-nth-primes)

‎solutions/beecrowd/1036/1036.clj

+1-2
Original file line numberDiff line numberDiff line change
@@ -4,8 +4,7 @@
44
(defn delta [a b c]
55
(-> (* b b)
66
(- 4)
7-
(* a)
8-
(* c)))
7+
(* a c)))
98

109
(defn bhaskara [a b delta]
1110
[(-> b

‎solutions/project-euler/001/001.clj

+1-1
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
(defn sum-all-divibles-by
44
[n limit]
55
(let [p (quot limit n)]
6-
(quot (* n (* p (+ p 1))) 2)))
6+
(quot (* n p (+ p 1)) 2)))
77

88
(defn main []
99
(- (+ (sum-all-divibles-by 3 999)

0 commit comments

Comments
 (0)