結果

問題 No.1729 ～サンプルはちゃんと見て！～　16進数と8進数(1)
ユーザー norioc
提出日時 2025-06-24 23:17:35
言語 Scheme
(Gauche-0.9.15)
結果
AC  
実行時間 88 ms / 2,000 ms
コード長 2,112 bytes
コンパイル時間 371 ms
コンパイル使用メモリ 8,612 KB
実行使用メモリ 23,552 KB
最終ジャッジ日時 2025-06-24 23:17:40
合計ジャッジ時間 4,095 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

(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 pow
  (case-lambda
   ((a b) (expt a b))
   ((a b m) (expt-mod a b m))))

(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-method frequencies ((xs <sequence>))
  (rlet1 ht (make-hash-table)
    (for-each (^x (hash-table-update! ht x 1+ 0))
              xs)))

(use gauche.generator)

(let ((N (input)))
  (let* ((a (string->number N 16))
         (b (number->string a 8))
         (ht (frequencies b)))
    (let ((ma (max (hash-table-values ht))))
      (let ((g (generate (^y
                          (hash-table-for-each ht (^(k v) (if (= v ma) (y k))))))))
        (apply prn (sort (generator->list g)))))))
0