結果

問題 No.81 すべて足すだけの簡単なお仕事です。
ユーザー norioc
提出日時 2025-06-25 23:21:27
言語 Scheme
(Gauche-0.9.15)
結果
AC  
実行時間 96 ms / 5,000 ms
コード長 2,469 bytes
コンパイル時間 227 ms
コンパイル使用メモリ 8,100 KB
実行使用メモリ 23,552 KB
最終ジャッジ日時 2025-06-25 23:21:33
合計ジャッジ時間 4,491 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

(use scheme.list)
(use util.match)
(use srfi.13)  ; string
(use srfi.42)  ; list-ec
(use srfi.197) ; chain
(use gauche.collection)
(use gauche.generator)

(define input read-line)

(define (ii)
  (string->number (read-line)))

(define (li)
  (let ((s (read-line)))
    (map string->number (string-split s " "))))

(define (prn . args)
  (for-each (lambda (i x)
              (when (> i 0)
                (display " "))
              (display x))
            (iota (length args))
            args)
  (newline))

(define int string->number)

(define-method min ((xs <sequence>))
  (apply min xs))
(define-method max ((xs <sequence>))
  (apply max xs))

(define (minmax . xs)
  (values->list (apply min&max xs)))
(define-method minmax ((xs <sequence>))
  (values->list (apply min&max xs)))

(define (sum xs) (apply + xs))

(define (divmod a b)
  (values->list (div-and-mod a b)))

(define (1+ n) (+ n 1))
(define (1- n) (- n 1))
(define (!= a b) (not (= a b)))

(define pow
  (case-lambda
   ((a b) (expt a b))
   ((a b m) (expt-mod a b m))))

(define isqrt exact-integer-sqrt)

(define-method frequencies ((xs <sequence>))
  (rlet1 ht (make-hash-table)
    (for-each (^x (hash-table-update! ht x 1+ 0))
              xs)))

(define (yn b)
  (prn (if b "Yes" "No")))

(define-macro (input! bindings . body)
  (let loop ((bs (reverse bindings))
             (res '()))
    (if (null? bs)
        `(let*-values ,res
           ,@body)
        (cond
         ((symbol? (car bs))
          (loop (cdr bs)
                (cons `((,(car bs)) (values (ii)))
                      res)))
         ((list? (car bs))
          (loop (cdr bs)
                (cons `(,(car bs) (apply values (li)))
                      res)))
         (else
          'error)))))

#;
(define-macro (clet1 pat expr . body)
  `(receive ,pat (apply values ,expr)
     ,@body))

(define mlet1 match-let1)

(define (f rat)
  (let ((num (numerator rat))
        (den (denominator rat)))
    (generate (^y
               (let loop ((num num))
                 (y (div num den))
                 (loop (* 10 (mod num den))))))))

(let* ((N (ii))
       (A (list-ec (: _ N) (input))))

  (let ((tot (sum (map (^a (string->number (string-append "#e" a)))
                       A))))
    (let ((g (f (abs tot))))
      (mlet1 (a . xs) (generator->list g 11)
        (format #t "~a~a.~a\n"
                (if (< tot 0) "-" "")
                a
                (string-join (map number->string xs) ""))))))
0