youz

/*
 * original code: https://github.com/shinh/elvm/blob/master/tools/bfopt.cc
 * usage:
 *   compile and run
 *   $ node bfopt.js src.bf
 *   compile only
 *   $ node bfopt.js -c src.bf
 */

const MEM_SIZE = 30000;

youz

youz

(defun f1 (z) (* z #C(1/2 1/2)))
(defun f2 (z) (- 1 (* z #C(1/2 -1/2))))
(defun c2p (z) (list (realpart z) (imagpart z)))

(defun gen (n)
  (let ((b (expt 2 (ash (1+ n) -1))))
    (loop
      for i from 0 to n
      for s = (list (list 0 1))
      then (mapcan (lambda (l) (list (mapcar #'f1 l) (mapcar #'f2 l))) s)

youz

;;; EQUALINE Mission 23 solver

(defstruct kifu
  (boards (list #(1 :+ 1 :+ 1 :+ 1 :+ 1))) ; 盤面のリスト (逆順)
  (routes nil)                             ; 指し手(int list)のリスト (逆順)
  )

(defun print-kifu (k)
  (loop for b in (reverse (kifu-boards k))
	for r in (cons nil (reverse (kifu-routes k)))

youz

# ref. https://www.cs.ox.ac.uk/people/jeremy.gibbons/publications/spigot.pdf
i=2:1+i
q=1:10*q*i*~1-2*i
r=180:10*u*(q*~2-5*i)+r-y*t
t=60:t*u
u=6+i*27+i*27
y=((q*~12-27*i)+5*r)/5*t
c='0+1001[y
([c):'.:>c

youz

# https://ruby-puzzles-2022.cookpad.tech/


def answer1(n)
  n+1
end


def answer2(str)

youz

CC = gcc
CFLAGS = -Wall -Wextra -std=gnu11 -O0
LIBS = -lmpfr -lgmp
SRC = pow.c
LIBMBIN = pow_m
OPENLIBMBIN = pow_o

all: $(LIBMBIN) $(OPENLIBMBIN)

$(LIBMBIN): $(SRC)

youz

;;; https://github.com/TokusiN/AtanMagic/blob/main/data.txt を保存して開いておく

(labels ((read-data (buf)
           (with-input-from-buffer (buf)
             (loop for i to 15 collect
               (mapcar #'read-from-string (split-string (read-line) #\,)))))
         (frac2comp (f)
           (complex (denominator f) (numerator f)))
         (verify1 (desc row)
           ; 各分数を複素数に変換(p/q → q+pi)し、総乗の虚数部=0 かつ 偏角の総和≒2πならokとする

youz

drop table if exists consts;
drop table if exists digits;

create table consts as select 10000 ndigits;
create table digits(n int primary key, d int);

.timer on
insert into digits(n, d)
with recursive init(n, num, den) as (

youz

-- ref https://www.cs.ox.ac.uk/people/jeremy.gibbons/publications/spigot.pdf

with recursive pigen(q, r, t, i, y, n) as (
  select 1::decimal, 180::decimal, 60::decimal, 2, 0::decimal, 0
  union all select 10*q*i*(2*i-1), 10*u*(q*(5*i-2)+r-y*t), t*u, i+1, y, n+1
  from (select q, r, t, i, n, 3*(3*i+1)*(3*i+2) as u, div(q*(27*i-12)+5*r,(5*t)) as y from pigen) as tmp
  where n < 1000
)
select string_agg(y::text, '') pi
from pigen where n > 0;