Skip to content

Instantly share code, notes, and snippets.

View boxp's full-sized avatar
👩‍💻
in reality

Keitaro Takeuchi boxp

👩‍💻
in reality
View GitHub Profile
(ns atcoder.core
(:use [clojure.string :only (join split split-lines)])
(:require [goog.events :as events]
[goog.dom :as dom]))
; don't fix me
(defn gen-args
[input]
(split-lines input))
@boxp
boxp / problem9.clj
Created June 22, 2013 14:24
clojureでproject-eulerに挑戦 〜九問目〜
(println
(filter
#(every? true? (take 3 %))
(for [a (range 1 500) b (range 1 500) c (range 1 999)]
[(and (> b a) (> c a) (> c b)) (= (+ (* a a) (* b b)) (* c c)) (= (+ a b c) 1000) (* a b c)])))
@boxp
boxp / problem8.clj
Created June 22, 2013 14:23
clojureでproject-eulerに挑戦 〜八問目〜
(def a (seq (str 7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450)))
(p
@boxp
boxp / problem7.clj
Created June 22, 2013 14:21
clojureでproject-eulerに挑戦 〜七問目〜
(println
(loop [x 5 primes [2 3]]
(if (= (count primes) 10001)
(last primes)
(recur (+ 2 x)
(if (every? #(not= (mod x %) 0) primes)
(conj primes x)
primes)))))
@boxp
boxp / problem6.clj
Created June 22, 2013 14:21
clojureでproject-eulerに挑戦 〜六問目〜
(print
(let [a (reduce + (range 1 101))]
(-
(* a a)
(reduce + (map #(* % %) (range 1 101))))))
@boxp
boxp / problem5.clj
Created June 22, 2013 14:20
clojureでproject-eulerに挑戦 〜五問目〜
(defn coll-divides? [x coll]
(every? true? (filter #(not= (mod x %) 0) coll)))
(print
(loop [x 20]
(if (coll-divides? x (range 1 21))
x
(recur (+ x 10)))))
@boxp
boxp / problem4.clj
Created June 22, 2013 14:17
clojureでproject-eulerに挑戦 〜四問目〜
(defn palindromic? [number]
(loop [numseq (seq (str number))]
(cond (<= (count numseq) 1) true
(= (first numseq) (last numseq)) (recur (drop-last (rest numseq)))
:else false)))
(def thdigits
(range 100 1000))
(println (last (sort (filter palindromic? (for [x thdigits y thdigits] (* x y))))))
@boxp
boxp / problem2.clj
Created June 22, 2013 14:16
clojureでproject-eulerに挑戦 〜第二問〜
(println
(reduce +
(loop [result [1 2]]
(if (> (last result) 4000000)
(filter even? (drop-last result))
(recur (conj result (reduce + (take-last 2 result))))))))
@boxp
boxp / problem1.clj
Created June 22, 2013 14:15
clojureでproject-eulerに挑戦 〜第一問〜
(reduce +
(filter
(fn [x]
(or (= 0 (rem x 5))
(= (rem x 3))))
(range 1 1001)))
@boxp
boxp / sum.c
Created June 19, 2013 00:09
東京電機大学未来科学部ロボット・メカトロニクス学科の学生として恥じることの無い洗礼されたプログラム☝( ◠‿◠☝)(コンピュータ基礎再履の課題)
#include <stdio.h>
int main(int argc, char const* argv[])
{
const int a = 500,b = 300,c = 0;
int as,bs,cs;
printf("PC|゚Д゚)ノ  イラッシャイ\n");
printf("[おしながき]\nクソネミ( ˘ω˘ ):%d円\nエクストリームドドスコンダーオ:%d円\nスマイル( ◠‿◠ ):%d円\n", a, b, c);
printf("いくつ買う? -> クソネミ( ˘ω˘ ):");
scanf("%d", &as);