Submission #1533440


Source Code Expand

(defparameter *n* (read))

(defun count-2-div-inner (n cnt)
  (let ((n%2 (mod n 2)))
    (if (not (= n%2 0))
        cnt
        (count-2-div-inner (/ n 2) (1+ cnt)))))

(defun count-2-div (n)
  (count-2-div-inner n 0))

(defun max-position (lst)
  (let ((max-value (apply #'max lst)))
    (position-if (lambda (x)
		   (= x max-value)) lst)))

(format t "~A~%"
        (1+ (max-position
             (mapcar #'count-2-div (loop for i from 1 to *n* collect i)))))

Submission Info

Submission Time
Task B - Break Number
User masatoi
Language Common Lisp (SBCL 1.1.14)
Score 200
Code Size 483 Byte
Status AC
Exec Time 162 ms
Memory 16480 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 4
AC × 17
Set Name Test Cases
Sample example0, example1, example2, example3
All example0, example1, example2, example3, handmade0, handmade1, handmade2, rand0, rand1, rand2, rand3, rand4, rand5, rand6, rand7, rand8, rand9
Case Name Status Exec Time Memory
example0 AC 162 ms 16480 KB
example1 AC 18 ms 6500 KB
example2 AC 18 ms 6496 KB
example3 AC 18 ms 6500 KB
handmade0 AC 17 ms 6500 KB
handmade1 AC 18 ms 6500 KB
handmade2 AC 18 ms 6500 KB
rand0 AC 17 ms 6500 KB
rand1 AC 17 ms 6504 KB
rand2 AC 18 ms 6500 KB
rand3 AC 18 ms 6504 KB
rand4 AC 18 ms 6504 KB
rand5 AC 18 ms 6496 KB
rand6 AC 17 ms 6504 KB
rand7 AC 18 ms 6500 KB
rand8 AC 18 ms 6504 KB
rand9 AC 18 ms 6504 KB