Skip to content

Instantly share code, notes, and snippets.

@kazua
kazua / primenum_check.php
Last active December 27, 2015 07:59
PHPで素数チェック
<?php
//write kazua
//素数チェック
//$value 素数かどうかをチェックする値
function pc($value) {
static $p = array();
if (is_int($value) === false || $value <= 1) return false;
else if (array_key_exists($value, $p) === true) return $p[$value];
$a = range(1, (int) round($value / 2));
@kazua
kazua / problem21.php
Created November 1, 2013 19:39
Project Euler Problem 21(PHP)
<?php
//http://odz.sakura.ne.jp/projecteuler/index.php?cmd=read&page=Problem%2021
//write kazua
$y = array();
$f = function($num) {
global $y;
$d = array();
for ($i = 1; $i <= $num / 2; $i++) if ($num % $i == 0) $d[] = $i;
$y[$num] = array_sum($d);
@kazua
kazua / problem020.php
Created October 30, 2013 13:13
Project Euler Problem 20(PHP)
<?php
//http://odz.sakura.ne.jp/projecteuler/index.php?cmd=read&page=Problem%2020
//write kazua
function array_bcproduct($a) {
$r = "1";
foreach ($a as $v)
$r = bcmul($r, $v);
return $r;
}
echo array_sum(str_split(array_bcproduct(range(1, 100))));
@kazua
kazua / array_bcproduct.php
Created October 30, 2013 13:10
PHPのarray_productの大きな数値バージョン
<?php
//array_bcproduct
//write kazua
//$a array
function array_bcproduct($a) {
$r = "1";
foreach ($a as $v)
$r = bcmul($r, $v);
return $r;
@kazua
kazua / array_scan.php
Created October 22, 2013 15:47
PHPでscanLeft,scanRight
<?php
//array_scanLeftとarray_scanRight
//write kazua
//$a array
//$f callback
//$i initial
function array_scanLeft($a, $f, $i) {
$r = array($i);
@kazua
kazua / problem080.php
Created October 21, 2013 15:31
Project Euler Problem 80(PHP)
<?php
//http://odz.sakura.ne.jp/projecteuler/index.php?cmd=read&page=Problem%2080
//write kazua
echo
array_sum(
array_map(
function ($value) {
return
array_sum(
str_split(
@kazua
kazua / problem80.scala
Last active December 25, 2015 23:09
Project Euler Problem 80
//http://projecteuler.net/index.php?section=problems&id=80(英語)
//http://odz.sakura.ne.jp/projecteuler/index.php?cmd=read&page=Problem%2080
//Kazua
import java.math.BigDecimal
import java.math.RoundingMode
object problem80 {
def sqrt(n : Int, s : Int, sr : BigDecimal = BigDecimal.valueOf(-1)) : BigDecimal = n match {
@kazua
kazua / problem016.php
Created October 18, 2013 14:35
Project Euler Problem 16(PHP)
<?php
//http://odz.sakura.ne.jp/projecteuler/index.php?cmd=read&page=Problem%2016
//write kazua
echo array_sum(str_split(bcpow(2, 1000)));
@kazua
kazua / problem015.php
Created October 16, 2013 13:24
Project Euler Problem 15(PHP)
<?php
//write kazua
$n = 20;
echo array_product(range(1, 2 * $n)) / pow(array_product(range(1, $n)), 2);
@kazua
kazua / problem006v2.php
Created October 15, 2013 13:04
Project Euler Problem 6(PHP)
<?php
//write kazua
echo pow(array_sum(range(1, 100)), 2)
- array_sum(array_map(function ($value) {
return pow($value, 2);
},
range(1, 100)));