AAAの紹介をします
これはAAAの背景です
inverse-fizzbuzz.egi
(define $main
1#(do {
(answer "fizz") ; => {[3 3]}
(answer "buzz") ; => {[5 5]}
(answer "fizz" "fizz" "buzz") ; => {[6 10]}
(define $collection2array | |
1#(generate-array (nth $ %1) [1 (length %1)])) | |
; > (collection2array {a b c}) | |
; (|a b c|) |
愛 11100110 10000100 10011011 | |
$ seq 1 1023 | dec2bin | sed 's/^/0000000000/' | grep -oE '.{12}$' | awk -vFS= -vOFS= '{print 111,$1,$2,11,$3,1,$4,$5,$6,$7,1,$8,$9,1,$10,$11,11,$12,11}' | perl -nle 'print pack ("B*", $_);' | grep 生 | |
生 | |
$ seq 1 1023 | dec2bin | sed 's/^/0000000000/' | grep -oE '.{12}$' | awk -vFS= -vOFS= '{print 111,$1,$2,11,$3,1,$4,$5,$6,$7,1,$8,$9,1,$10,$11,11,$12,11}' | perl -nle 'print pack ("B*", $_);' | grep 死 | |
死 |
# Extract size from information header. 14 is the octet length of file header. | |
od -tx1 -An flower.bmp \ | |
| tr -dc 'a-z0-9' \ | |
| fold -w 2 \ | |
| sed -n '14,15p' \ | |
| tr -d '\n' \ | |
| sed 's/./\U&/g;s/^/obase=10;ibase=16;/' \ | |
| awk 1 \ | |
| bc \ | |
| awk '{print $1+14}' |
# スクレイピング | |
seq 500 \ | |
| while read n;do echo "$n"; w3m -dump -cols 999 "https://ja.wikipedia.org/wiki/$n" | sed -n '/性質\[編集\]/,/\[編集\]/p' > "$n" ;done | |
# 最も性質が多い数は。。 | |
seq 500 | while read f; do echo -n "$f "; cat "$f" | grep '•' | grep -c .; done | sort -k2,2n | |
. | |
. | |
. |
#!/usr/bin/env egison | |
(define $main | |
(lambda [$args] | |
(each display | |
(farray-same2 farray)))) | |
(define $farray | |
(filter 1#(eq? (length %1) 3) | |
(map (p-f $) (take 100 nats)))) |
#!/bin/bash | |
THIS_DIR="$(cd "$(dirname "${BASH_SOURCE[0]:-${(%):-%N}}")"; pwd)" | |
files=("$(find ${THIS_DIR-}/lib -type f)") | |
class_lines=("$(printf '%s\n' "${files[@]}" \ | |
| xargs -n 1 grep -m 1 -E '^(abstract )?class' \ | |
| sed -r 's/^.*class ([A-Za-z]+)/\1/')") | |
class_names=("$(printf '%s\n' "${class_lines[@]}" | awk '{print $1}')") | |
remove_buildin_classes () { |
import java.util.HashMap; | |
import java.util.Map; | |
class Test { | |
public static void main(String args[]) { | |
int num = 100; | |
Map<Integer, Boolean> list = new HashMap<Integer, Boolean>(); | |
for (int i = 2; i <= num; i++) { | |
list.put(i, true); | |
} |
; 【話題の一行問題】東大数学2015第5問【2015Cmが偶数】をEgisonで解く | |
; https://www.youtube.com/watch?v=MfrT_QGCkRo | |
(define $main | |
(lambda [$argv] | |
(each display | |
(match | |
(map 1#(2#[%1 %2 (modulo %2 2)] %1 (comb 2015 %1)) | |
(take 2015 nats)) | |
(list [integer integer integer]) |