code
stringlengths 1
46.1k
⌀ | label
class label 1.18k
classes | domain_label
class label 21
classes | index
stringlengths 4
5
|
|---|---|---|---|
>>> s =
>>> s[0] =
Traceback (most recent call last):
File , line 1, in <module>
s[0] =
TypeError: 'str' object does not support item assignment | 895Enforced immutability
| 3python
| n9viz |
function equilibrium(a) {
var N = a.length, i, l = [], r = [], e = []
for (l[0] = a[0], r[N - 1] = a[N - 1], i = 1; i<N; i++)
l[i] = l[i - 1] + a[i], r[N - i - 1] = r[N - i] + a[N - i - 1]
for (i = 0; i < N; i++)
if (l[i] === r[i]) e.push(i)
return e
} | 893Equilibrium index
| 10javascript
| vkw25 |
class EulerSumOfPowers {
static final int MAX_NUMBER = 250
static void main(String[] args) {
boolean found = false
long[] fifth = new long[MAX_NUMBER]
for (int i = 1; i <= MAX_NUMBER; i++) {
long i2 = i * i
fifth[i - 1] = i2 * i2 * i
}
for (int a = 0; a < MAX_NUMBER && !found; a++) {
for (int b = a; b < MAX_NUMBER && !found; b++) {
for (int c = b; c < MAX_NUMBER && !found; c++) {
for (int d = c; d < MAX_NUMBER && !found; d++) {
long sum = fifth[a] + fifth[b] + fifth[c] + fifth[d]
int e = Arrays.binarySearch(fifth, sum)
found = (e >= 0)
if (found) {
println("${a + 1}^5 + ${b + 1}^5 + ${c + 1}^5 + ${d + 1}^5 + ${e + 1}^5")
}
}
}
}
}
}
} | 892Euler's sum of powers conjecture
| 7groovy
| reogh |
package main
import (
"fmt"
"io/ioutil"
"log"
)
func main() {
empty, err := IsEmptyDir("/tmp")
if err != nil {
log.Fatalln(err)
}
if empty {
fmt.Printf("/tmp is empty\n")
} else {
fmt.Printf("/tmp is not empty\n")
}
}
func IsEmptyDir(name string) (bool, error) {
entries, err := ioutil.ReadDir(name)
if err != nil {
return false, err
}
return len(entries) == 0, nil
} | 899Empty directory
| 0go
| qttxz |
def isDirEmpty = { dirName ->
def dir = new File(dirName)
dir.exists() && dir.directory && (dir.list() as List).empty
} | 899Empty directory
| 7groovy
| 1oop6 |
msg =
msg <<
puts msg
puts msg.frozen?
msg.freeze
puts msg.frozen?
begin
msg <<
rescue => e
p e
end
puts msg
msg2 = msg
msg =
puts msg.frozen?
puts msg2.frozen? | 895Enforced immutability
| 14ruby
| fl5dr |
let x = 3;
x += 2; | 895Enforced immutability
| 15rust
| t24fd |
val pi = 3.14159
val msg = "Hello World" | 895Enforced immutability
| 16scala
| 65731 |
import Data.List
import Data.List.Ordered
main :: IO ()
main = print $ head [(x0,x1,x2,x3,x4) |
x3 <- [1..250-1],
x2 <- [1..x3-1],
x1 <- [1..x2-1],
x0 <- [1..x1-1],
let p5Sum = x0^5 + x1^5 + x2^5 + x3^5,
let p5List = [i^5|i <- [1..]],
member p5Sum p5List,
let Just x4 = elemIndex p5Sum p5List ] | 892Euler's sum of powers conjecture
| 8haskell
| dcgn4 |
package EC;
{
our ($A, $B) = (0, 7);
package EC::Point;
sub new { my $class = shift; bless [ @_ ], $class }
sub zero { bless [], shift }
sub x { shift->[0] }; sub y { shift->[1] };
sub double {
my $self = shift;
return $self unless @$self;
my $L = (3 * $self->x**2) / (2*$self->y);
my $x = $L**2 - 2*$self->x;
bless [ $x, $L * ($self->x - $x) - $self->y ], ref $self;
}
use overload
'==' => sub { my ($p, $q) = @_; $p->x == $q->x and $p->y == $q->y },
'+' => sub {
my ($p, $q) = @_;
return $p->double if $p == $q;
return $p unless @$q;
return $q unless @$p;
my $slope = ($q->y - $p->y) / ($q->x - $p->x);
my $x = $slope**2 - $p->x - $q->x;
bless [ $x, $slope * ($p->x - $x) - $p->y ], ref $p;
},
q{""} => sub {
my $self = shift;
return @$self
? sprintf "EC-point at x=%f, y=%f", @$self
: 'EC point at infinite';
}
}
package Test;
my $p = +EC::Point->new(-($EC::B - 1)**(1/3), 1);
my $q = +EC::Point->new(-($EC::B - 4)**(1/3), 2);
my $s = $p + $q, "\n";
print "$_\n" for $p, $q, $s;
print "check alignment... ";
print abs(($q->x - $p->x)*(-$s->y - $p->y) - ($q->y - $p->y)*($s->x - $p->x)) < 0.001
? "ok" : "wrong"; | 897Elliptic curve arithmetic
| 2perl
| xfzw8 |
size = 100
eca = ElemCellAutomat.new(+*(size-1), 30)
eca.take(80).map{|line| line[0]}.each_slice(8){|bin| p bin.join.to_i(2)} | 898Elementary cellular automaton/Random Number Generator
| 14ruby
| c7j9k |
null | 898Elementary cellular automaton/Random Number Generator
| 15rust
| ljhcc |
import System.Directory (getDirectoryContents)
import System.Environment (getArgs)
isEmpty x = getDirectoryContents x >>= return . f . (== [".", ".."])
where f True = "Directory is empty"
f False = "Directory is not empty"
main = getArgs >>= isEmpty . (!! 0) >>= putStrLn | 899Empty directory
| 8haskell
| mggyf |
null | 893Equilibrium index
| 11kotlin
| t2rf0 |
print $ENV{HOME}, "\n"; | 891Environment variables
| 2perl
| oy58x |
$_ENV['HOME'] | 891Environment variables
| 12php
| gao42 |
import Foundation
let numberFormat = "%7.3f"
let k = 0.07
let initialTemp = 100.0
let finalTemp = 20.0
let startTime = 0
let endTime = 100
func ivpEuler(function: (Double, Double) -> Double, initialValue: Double, step: Int) {
print(String(format: " Step%2d: ", step), terminator: "")
var y = initialValue
for t in stride(from: startTime, through: endTime, by: step) {
if t% 10 == 0 {
print(String(format: numberFormat, y), terminator: "")
}
y += Double(step) * function(Double(t), y)
}
print()
}
func analytic() {
print(" Time: ", terminator: "")
for t in stride(from: startTime, through: endTime, by: 10) {
print(String(format: "%7d", t), terminator: "")
}
print("\nAnalytic: ", terminator: "")
for t in stride(from: startTime, through: endTime, by: 10) {
let temp = finalTemp + (initialTemp - finalTemp) * exp(-k * Double(t))
print(String(format: numberFormat, temp), terminator: "")
}
print()
}
func cooling(t: Double, temp: Double) -> Double {
return -k * (temp - finalTemp)
}
analytic()
ivpEuler(function: cooling, initialValue: initialTemp, step: 2)
ivpEuler(function: cooling, initialValue: initialTemp, step: 5)
ivpEuler(function: cooling, initialValue: initialTemp, step: 10) | 886Euler method
| 17swift
| 7w3rq |
function Binomial( n, k )
if k > n then return nil end
if k > n/2 then k = n - k end | 889Evaluate binomial coefficients
| 1lua
| flhdp |
(defn emirp? [v]
(let [a (biginteger v)
b (biginteger (clojure.string/reverse (str v)))]
(and (not= a b)
(.isProbablePrime a 16)
(.isProbablePrime b 16))))
(println "first20: " (clojure.string/join " " (take 20 (filter emirp? (iterate inc 0)))))
(println "7700-8000: " (clojure.string/join " " (filter emirp? (range 7700 8000))))
(println "10,000: " (nth (filter emirp? (iterate inc 0)) 9999)) | 903Emirp primes
| 6clojure
| 41h5o |
import java.nio.file.Paths; | 899Empty directory
| 9java
| flldv |
null | 899Empty directory
| 10javascript
| y446r |
let a = 1
a = 1 | 895Enforced immutability
| 17swift
| dcunh |
public class eulerSopConjecture
{
static final int MAX_NUMBER = 250;
public static void main( String[] args )
{
boolean found = false;
long[] fifth = new long[ MAX_NUMBER ];
for( int i = 1; i <= MAX_NUMBER; i ++ )
{
long i2 = i * i;
fifth[ i - 1 ] = i2 * i2 * i;
} | 892Euler's sum of powers conjecture
| 9java
| szlq0 |
class Point:
b = 7
def __init__(self, x=float('inf'), y=float('inf')):
self.x = x
self.y = y
def copy(self):
return Point(self.x, self.y)
def is_zero(self):
return self.x > 1e20 or self.x < -1e20
def neg(self):
return Point(self.x, -self.y)
def dbl(self):
if self.is_zero():
return self.copy()
try:
L = (3 * self.x * self.x) / (2 * self.y)
except ZeroDivisionError:
return Point()
x = L * L - 2 * self.x
return Point(x, L * (self.x - x) - self.y)
def add(self, q):
if self.x == q.x and self.y == q.y:
return self.dbl()
if self.is_zero():
return q.copy()
if q.is_zero():
return self.copy()
try:
L = (q.y - self.y) / (q.x - self.x)
except ZeroDivisionError:
return Point()
x = L * L - self.x - q.x
return Point(x, L * (self.x - x) - self.y)
def mul(self, n):
p = self.copy()
r = Point()
i = 1
while i <= n:
if i&n:
r = r.add(p)
p = p.dbl()
i <<= 1
return r
def __str__(self):
return .format(self.x, self.y)
def show(s, p):
print(s, if p.is_zero() else p)
def from_y(y):
n = y * y - Point.b
x = n**(1./3) if n>=0 else -((-n)**(1./3))
return Point(x, y)
a = from_y(1)
b = from_y(2)
show(, a)
show(, b)
c = a.add(b)
show(, c)
d = c.neg()
show(, d)
show(, c.add(d))
show(, a.add(b.add(d)))
show(, a.mul(12345)) | 897Elliptic curve arithmetic
| 3python
| qt3xi |
null | 899Empty directory
| 11kotlin
| 8660q |
function array_sum(t)
assert(type(t) == "table", "t must be a table!")
local sum = 0
for i=1, #t do sum = sum + t[i] end
return sum
end
function equilibrium_index(t)
assert(type(t) == "table", "t must be a table!")
local left, right, ret = 0, array_sum(t), -1
for i,j in pairs(t) do
right = right - j
if left == right then
ret = i
break
end
left = left + j
end
return ret
end
print(equilibrium_index({-7, 1, 5, 2, -4, 3, 0})) | 893Equilibrium index
| 1lua
| zv7ty |
import os
os.environ['HOME'] | 891Environment variables
| 3python
| im4of |
Sys.getenv("PATH") | 891Environment variables
| 13r
| sz2qy |
var eulers_sum_of_powers = function (iMaxN) {
var aPow5 = [];
var oPow5ToN = {};
for (var iP = 0; iP <= iMaxN; iP++) {
var iPow5 = Math.pow(iP, 5);
aPow5.push(iPow5);
oPow5ToN[iPow5] = iP;
}
for (var i0 = 1; i0 <= iMaxN; i0++) {
for (var i1 = 1; i1 <= i0; i1++) {
for (var i2 = 1; i2 <= i1; i2++) {
for (var i3 = 1; i3 <= i2; i3++) {
var iPow5Sum = aPow5[i0] + aPow5[i1] + aPow5[i2] + aPow5[i3];
if (typeof oPow5ToN[iPow5Sum] != 'undefined') {
return {
i0: i0,
i1: i1,l
i2: i2,
i3: i3,
iSum: oPow5ToN[iPow5Sum]
};
}
}
}
}
}
};
var oResult = eulers_sum_of_powers(250);
console.log(oResult.i0 + '^5 + ' + oResult.i1 + '^5 + ' + oResult.i2 +
'^5 + ' + oResult.i3 + '^5 = ' + oResult.iSum + '^5'); | 892Euler's sum of powers conjecture
| 10javascript
| n94iy |
const char *str = ;
if (str) { ... }
if (str[0] == '\0') { ... }
if ( (str == NULL) || (strlen(str) == 0)) { ... }
if (strcmp(str, ) == 0) { ... } | 904Empty string
| 5c
| zvmtx |
my @fruits = qw(apple banana cherry);
my %fruits = ( apple => 0, banana => 1, cherry => 2 ); | 894Enumerations
| 2perl
| dc5nw |
function scandir(directory)
local i, t, popen = 0, {}, io.popen
local pfile = popen('ls -a "'..directory..'"')
for filename in pfile:lines() do
if filename ~= '.' and filename ~= '..' then
i = i + 1
t[i] = filename
end
end
pfile:close()
return t
end
function isemptydir(directory)
return #scandir(directory) == 0
end | 899Empty directory
| 1lua
| oyy8h |
ENV['HOME'] | 891Environment variables
| 14ruby
| dcrns |
use std::env;
fn main() {
println!("{:?}", env::var("HOME"));
println!();
for (k, v) in env::vars().filter(|(k, _)| k.starts_with('P')) {
println!("{}: {}", k, v);
}
} | 891Environment variables
| 15rust
| fl7d6 |
sys.env.get("HOME") | 891Environment variables
| 16scala
| 3ukzy |
$fruits = array( , , );
$fruits = array( => 0, => 1, => 2 );
class Fruit {
const APPLE = 0;
const BANANA = 1;
const CHERRY = 2;
}
$value = Fruit::APPLE;
define(, 0);
define(, 1);
define(, 2); | 894Enumerations
| 12php
| jxo7z |
fun main(args: Array<String>) {
val p5 = LongArray(250){ it.toLong() * it * it * it * it }
var sum: Long
var y: Int
var found = false
loop@ for (x0 in 0 .. 249)
for (x1 in 0 .. x0 - 1)
for (x2 in 0 .. x1 - 1)
for (x3 in 0 .. x2 - 1) {
sum = p5[x0] + p5[x1] + p5[x2] + p5[x3]
y = p5.binarySearch(sum)
if (y >= 0) {
println("$x0^5 + $x1^5 + $x2^5 + $x3^5 = $y^5")
found = true
break@loop
}
}
if (!found) println("No solution was found")
} | 892Euler's sum of powers conjecture
| 11kotlin
| ai613 |
(def x "")
(let [x ""]
)
(= x "")
(not= x "") | 904Empty string
| 6clojure
| 9rvma |
print("USER: \(ProcessInfo.processInfo.environment["USER"]?? "Not set")")
print("PATH: \(ProcessInfo.processInfo.environment["PATH"]?? "Not set")") | 891Environment variables
| 17swift
| n9gil |
null | 892Euler's sum of powers conjecture
| 1lua
| enyac |
>>> from enum import Enum
>>> Contact = Enum('Contact', 'FIRST_NAME, LAST_NAME, PHONE')
>>> Contact.__members__
mappingproxy(OrderedDict([('FIRST_NAME', <Contact.FIRST_NAME: 1>), ('LAST_NAME', <Contact.LAST_NAME: 2>), ('PHONE', <Contact.PHONE: 3>)]))
>>>
>>>
>>> class Contact2(Enum):
FIRST_NAME = 1
LAST_NAME = 2
PHONE = 3
>>> Contact2.__members__
mappingproxy(OrderedDict([('FIRST_NAME', <Contact2.FIRST_NAME: 1>), ('LAST_NAME', <Contact2.LAST_NAME: 2>), ('PHONE', <Contact2.PHONE: 3>)]))
>>> | 894Enumerations
| 3python
| fl4de |
factor(c("apple", "banana", "cherry")) | 894Enumerations
| 13r
| oy284 |
sub dir_is_empty {!<$_[0]/*>} | 899Empty directory
| 2perl
| 4115d |
main()
{
return 0;
} | 905Empty program
| 5c
| 65932 |
sub binomial {
use bigint;
my ($r, $n, $k) = (1, @_);
for (1 .. $k) { $r *= $n--; $r /= $_ }
$r;
}
print binomial(5, 3); | 889Evaluate binomial coefficients
| 2perl
| jxt7f |
package main
import (
"flag"
"fmt"
"github.com/jbarham/primegen.go" | 903Emirp primes
| 0go
| xfowf |
$dir = 'path_here';
if(is_dir($dir)){
$list = array_diff(scandir($dir), array('..', '.'));
if(empty($list)){
echo 'dir is empty';
}
else{
echo 'dir is not empty';
}
}
else{
echo 'not a directory';
} | 899Empty directory
| 12php
| immov |
sub eq_index {
my ( $i, $sum, %sums ) = ( 0, 0 );
for (@_) {
push @{ $sums{ $sum * 2 + $_ } }, $i++;
$sum += $_;
}
return join ' ', @{ $sums{$sum} || [] }, "\n";
}
print eq_index qw( -7 1 5 2 -4 3 0 );
print eq_index qw( 2 4 6 );
print eq_index qw( 2 9 2 );
print eq_index qw( 1 -1 1 -1 1 -1 1 ); | 893Equilibrium index
| 2perl
| ksdhc |
<?php
$n=5;
$k=3;
function factorial($val){
for($f=2;$val-1>1;$f*=$val--);
return $f;
}
$binomial_coefficient=factorial($n)/(factorial($k)*factorial($n-$k));
echo $binomial_coefficient;
?> | 889Evaluate binomial coefficients
| 12php
| t2kf1 |
class Emirp { | 903Emirp primes
| 7groovy
| p8xbo |
module Fruits
APPLE = 0
BANANA = 1
CHERRY = 2
end
FRUITS = [:apple, :banana, :cherry]
val = :banana
FRUITS.include?(val) | 894Enumerations
| 14ruby
| zvrtw |
enum Fruits {
Apple,
Banana,
Cherry
}
enum FruitsWithNumbers {
Strawberry = 0,
Pear = 27,
}
fn main() { | 894Enumerations
| 15rust
| 3u7z8 |
main() {
var empty = '';
if (empty.isEmpty) {
print('it is empty');
}
if (empty.isNotEmpty) {
print('it is not empty');
}
} | 904Empty string
| 18dart
| oyf8s |
start_up = proc ()
end start_up | 905Empty program
| 6clojure
| ljucb |
<?php
$arr = array(-7, 1, 5, 2, -4, 3, 0);
function getEquilibriums($arr) {
$right = array_sum($arr);
$left = 0;
$equilibriums = array();
foreach($arr as $key => $value){
$right -= $value;
if($left == $right) $equilibriums[] = $key;
$left += $value;
}
return $equilibriums;
}
echo ;
foreach (getEquilibriums($arr) as $r) echo ;
?> | 893Equilibrium index
| 12php
| 3ujzq |
sub factorial
{
my $n = shift;
my $result = 1;
for (my $i = 1; $i <= $n; ++$i)
{
$result *= $i;
};
$result;
}
sub factorial {
my $r = 1;
$r *= $_ for 1..shift;
$r;
} | 882Factorial
| 2perl
| zvqtb |
#!/usr/bin/env runghc
import Data.HashSet (HashSet, fromList, member)
import Data.List
import Data.Numbers.Primes
import System.Environment
import System.Exit
import System.IO
startDigOK :: Integer -> Bool
startDigOK n = head (show n) `elem` "1379"
filtPrimes :: [Integer]
filtPrimes = filter startDigOK primes
nDigsFPr :: Integer -> [Integer]
nDigsFPr n =
takeWhile (< hi) $ dropWhile (< lo) filtPrimes
where lo = 10 ^ (n - 1)
hi = 10 ^ n
nDigsFPrHS :: Integer -> HashSet Integer
nDigsFPrHS n = fromList $ nDigsFPr n
fPrByDigs :: [HashSet Integer]
fPrByDigs = map nDigsFPrHS [0 ..]
isEmirp :: Integer -> Bool
isEmirp n =
let revStr = reverse $ show n
reversed = read revStr
hs = fPrByDigs !! length revStr
in (startDigOK n) && (reversed /= n) && (reversed `member` hs)
emirps :: [Integer]
emirps = filter isEmirp primes
emirpSlice :: Integer -> Integer -> [Integer]
emirpSlice from to =
genericTake numToTake $ genericDrop numToDrop emirps
where
numToDrop = from - 1
numToTake = 1 + to - from
emirpValues :: Integer -> Integer -> [Integer]
emirpValues lo hi =
dropWhile (< lo) $ takeWhile (<= hi) emirps
usage = do
name <- getProgName
putStrLn $ "usage: " ++ name ++ " lo hi [slice | values]"
exitFailure
main = do
hSetBuffering stdout NoBuffering
args <- getArgs
fixedArgs <- case length args of
1 -> return $ args ++ args ++ ["slice"]
2 -> return $ args ++ ["slice"]
3 -> return args
_ -> usage
let lo = read $ fixedArgs !! 0
hi = read $ fixedArgs !! 1
case fixedArgs !! 2 of
"slice" -> print $ emirpSlice lo hi
"values" -> print $ emirpValues lo hi
_ -> usage | 903Emirp primes
| 8haskell
| y4266 |
sealed abstract class Fruit
case object Apple extends Fruit
case object Banana extends Fruit
case object Cherry extends Fruit | 894Enumerations
| 16scala
| mgkyc |
import os;
if os.listdir(raw_input()):
print
else:
print | 899Empty directory
| 3python
| gaa4h |
is_dir_empty <- function(path){
if(length(list.files(path)) == 0)
print("This folder is empty")
}
is_dir_empty(path) | 899Empty directory
| 13r
| vkk27 |
package main
import (
"fmt"
"math"
"strings"
)
func main(){
fmt.Println(H("1223334444"))
}
func H(data string) (entropy float64) {
if data == "" {
return 0
}
for i := 0; i < 256; i++ {
px := float64(strings.Count(data, string(byte(i)))) / float64(len(data))
if px > 0 {
entropy += -px * math.Log2(px)
}
}
return entropy
} | 900Entropy
| 0go
| 65u3p |
public class Emirp{ | 903Emirp primes
| 9java
| dc6n9 |
String.metaClass.getShannonEntrophy = {
-delegate.inject([:]) { map, v -> map[v] = (map[v] ?: 0) + 1; map }.values().inject(0.0) { sum, v ->
def p = (BigDecimal)v / delegate.size()
sum + p * Math.log(p) / Math.log(2)
}
} | 900Entropy
| 7groovy
| dc9n3 |
function isPrime(n) {
if (!(n % 2) || !(n % 3)) return 0;
var p = 1;
while (p * p < n) {
if (n % (p += 4) == 0 || n % (p += 2) == 0) {
return false
}
}
return true
}
function isEmirp(n) {
var s = n.toString();
var r = s.split("").reverse().join("");
return r != n && isPrime(n) && isPrime(r);
}
function main() {
var out = document.getElementById("content");
var c = 0;
var x = 11;
var last;
var str;
while (c < 10000) {
if (isEmirp(x)) {
c += 1; | 903Emirp primes
| 10javascript
| 65l38 |
enum Fruit {
case Apple
case Banana
case Cherry
} | 894Enumerations
| 17swift
| t2gfl |
Dir.entries().empty? | 899Empty directory
| 14ruby
| 7wwri |
use std::fs::read_dir;
use std::error::Error;
fn main() {
for path in std::env::args().skip(1) { | 899Empty directory
| 15rust
| jxx72 |
import Data.List
main = print $ entropy "1223334444"
entropy :: (Ord a, Floating c) => [a] -> c
entropy = sum . map lg . fq . map genericLength . group . sort
where lg c = -c * logBase 2 c
fq c = let sc = sum c in map (/ sc) c | 900Entropy
| 8haskell
| jxw7g |
def eqindex2Pass(data):
suml, sumr, ddelayed = 0, sum(data), 0
for i, d in enumerate(data):
suml += ddelayed
sumr -= d
ddelayed = d
if suml == sumr:
yield i | 893Equilibrium index
| 3python
| b0fkr |
def binomialCoeff(n, k):
result = 1
for i in range(1, k+1):
result = result * (n-i+1) / i
return result
if __name__ == :
print(binomialCoeff(5, 3)) | 889Evaluate binomial coefficients
| 3python
| hqzjw |
import java.io.File
def isDirEmpty(file:File) : Boolean =
return file.exists && file.isDirectory && file.list.isEmpty | 899Empty directory
| 16scala
| b00k6 |
main() {} | 905Empty program
| 18dart
| n9tiq |
import java.lang.Math;
import java.util.Map;
import java.util.HashMap;
public class REntropy {
@SuppressWarnings("boxing")
public static double getShannonEntropy(String s) {
int n = 0;
Map<Character, Integer> occ = new HashMap<>();
for (int c_ = 0; c_ < s.length(); ++c_) {
char cx = s.charAt(c_);
if (occ.containsKey(cx)) {
occ.put(cx, occ.get(cx) + 1);
} else {
occ.put(cx, 1);
}
++n;
}
double e = 0.0;
for (Map.Entry<Character, Integer> entry: occ.entrySet()) {
char cx = entry.getKey();
double p = (double) entry.getValue() / n;
e += p * log2(p);
}
return -e;
}
private static double log2(double a) {
return Math.log(a) / Math.log(2);
}
public static void main(String[] args) {
String[] sstr = {
"1223334444",
"1223334444555555555",
"122333",
"1227774444",
"aaBBcccDDDD",
"1234567890abcdefghijklmnopqrstuvwxyz",
"Rosetta Code",
};
for (String ss: sstr) {
double entropy = REntropy.getShannonEntropy(ss);
System.out.printf("Shannon entropy of%40s:%.12f%n", "\"" + ss + "\"", entropy);
}
return;
}
} | 900Entropy
| 9java
| ubkvv |
use constant MAX => 250;
my @p5 = (0,map { $_**5 } 1 .. MAX-1);
my $s = 0;
my %p5 = map { $_ => $s++ } @p5;
for my $x0 (1..MAX-1) {
for my $x1 (1..$x0-1) {
for my $x2 (1..$x1-1) {
for my $x3 (1..$x2-1) {
my $sum = $p5[$x0] + $p5[$x1] + $p5[$x2] + $p5[$x3];
die "$x3 $x2 $x1 $x0 $p5{$sum}\n" if exists $p5{$sum};
}
}
}
} | 892Euler's sum of powers conjecture
| 2perl
| 9r1mn |
<?php
function factorial($n) {
if ($n < 0) {
return 0;
}
$factorial = 1;
for ($i = $n; $i >= 1; $i--) {
$factorial = $factorial * $i;
}
return $factorial;
}
?> | 882Factorial
| 12php
| b0vk9 |
choose(5,3) | 889Evaluate binomial coefficients
| 13r
| gan47 |
null | 903Emirp primes
| 11kotlin
| 03dsf |
null | 900Entropy
| 10javascript
| 7werd |
function isPrime (n)
if n < 2 then return false end
if n < 4 then return true end
if n % 2 == 0 then return false end
for d = 3, math.sqrt(n), 2 do
if n % d == 0 then return false end
end
return true
end
function isEmirp (n)
if not isPrime(n) then return false end
local rev = tonumber(string.reverse(n))
if rev == n then return false end
return isPrime(rev)
end
function emirpGen (mode, a, b)
local count, n, eString = 0, 0, ""
if mode == "between" then
for n = a, b do
if isEmirp(n) then eString = eString .. n .. " " end
end
return eString
end
while count < a do
n = n + 1
if isEmirp(n) then
eString = eString .. n .. " "
count = count + 1
end
end
if mode == "first" then return eString end
if mode == "Nth" then return n end
end
if #arg > 1 and #arg < 4 then
print(emirpGen(arg[1], tonumber(arg[2]), tonumber(arg[3])))
else
print("Wrong number of arguments")
end | 903Emirp primes
| 1lua
| 86f0e |
<?php
function eulers_sum_of_powers () {
$max_n = 250;
$pow_5 = array();
$pow_5_to_n = array();
for ($p = 1; $p <= $max_n; $p ++) {
$pow5 = pow($p, 5);
$pow_5 [$p] = $pow5;
$pow_5_to_n[$pow5] = $p;
}
foreach ($pow_5 as $n_0 => $p_0) {
foreach ($pow_5 as $n_1 => $p_1) {
if ($n_0 < $n_1) continue;
foreach ($pow_5 as $n_2 => $p_2) {
if ($n_1 < $n_2) continue;
foreach ($pow_5 as $n_3 => $p_3) {
if ($n_2 < $n_3) continue;
$pow_5_sum = $p_0 + $p_1 + $p_2 + $p_3;
if (isset($pow_5_to_n[$pow_5_sum])) {
return array($n_0, $n_1, $n_2, $n_3, $pow_5_to_n[$pow_5_sum]);
}
}
}
}
}
}
list($n_0, $n_1, $n_2, $n_3, $y) = eulers_sum_of_powers();
echo ;
?> | 892Euler's sum of powers conjecture
| 12php
| wdmep |
package main
import (
"fmt"
"math/big"
)
func main() {
test(-2)
test(-1)
test(0)
test(1)
test(2)
testBig("-222222222222222222222222222222222222")
testBig("-1")
testBig("0")
testBig("1")
testBig("222222222222222222222222222222222222")
}
func test(n int) {
fmt.Printf("Testing integer%3d: ", n) | 902Even or odd
| 0go
| wdoeg |
class Integer
def choose(k)
pTop = (self-k+1 .. self).inject(1, &:*)
pBottom = (2 .. k).inject(1, &:*)
pTop / pBottom
end
end
p 5.choose(3)
p 60.choose(30) | 889Evaluate binomial coefficients
| 14ruby
| b06kq |
null | 900Entropy
| 11kotlin
| 9rgmh |
def eq_indices(list)
list.each_index.select do |i|
list[0...i].sum == list[i+1..-1].sum
end
end | 893Equilibrium index
| 14ruby
| 1ozpw |
extern crate num;
use num::traits::Zero;
fn equilibrium_indices(v: &[i32]) -> Vec<usize> {
let mut right = v.iter().sum();
let mut left = i32::zero();
v.iter().enumerate().fold(vec![], |mut out, (i, &el)| {
right -= el;
if left == right {
out.push(i);
}
left += el;
out
})
}
fn main() {
let v = [-7i32, 1, 5, 2, -4, 3, 0];
let indices = equilibrium_indices(&v);
println!("Equilibrium indices for {:?} are: {:?}", v, indices);
} | 893Equilibrium index
| 15rust
| ai314 |
def isOdd = { int i -> (i & 1) as boolean }
def isEven = {int i -> ! isOdd(i) } | 902Even or odd
| 7groovy
| b0xky |
Prelude> even 5
False
Prelude> even 42
True
Prelude> odd 5
True
Prelude> odd 42
False | 902Even or odd
| 8haskell
| 6523k |
fn fact(n:u32) -> u64 {
let mut f:u64 = n as u64;
for i in 2..n {
f *= i as u64;
}
return f;
}
fn choose(n: u32, k: u32) -> u64 {
let mut num:u64 = n as u64;
for i in 1..k {
num *= (n-i) as u64;
}
return num / fact(k);
}
fn main() {
println!("{}", choose(5,3));
} | 889Evaluate binomial coefficients
| 15rust
| p8ybu |
def getEquilibriumIndex(A: Array[Int]): Int = {
val bigA: Array[BigInt] = A.map(BigInt(_))
val partialSums: Array[BigInt] = bigA.scanLeft(BigInt(0))(_+_).tail
def lSum(i: Int): BigInt = if (i == 0) 0 else partialSums(i - 1)
def rSum(i: Int): BigInt = partialSums.last - partialSums(i)
def isRandLSumEqual(i: Int): Boolean = lSum(i) == rSum(i)
(0 until partialSums.length).find(isRandLSumEqual).getOrElse(-1)
} | 893Equilibrium index
| 16scala
| xfmwg |
object Binomial {
def main(args: Array[String]): Unit = {
val n=5
val k=3
val result=binomialCoefficient(n,k)
println("The Binomial Coefficient of%d and%d equals%d.".format(n, k, result))
}
def binomialCoefficient(n:Int, k:Int)=fact(n) / (fact(k) * fact(n-k))
def fact(n:Int):Int=if (n==0) 1 else n*fact(n-1)
} | 889Evaluate binomial coefficients
| 16scala
| encab |
extension Collection where Element: Numeric {
func equilibriumIndexes() -> [Index] {
guard!isEmpty else {
return []
}
let sumAll = reduce(0, +)
var ret = [Index]()
var sumLeft: Element = 0
var sumRight: Element
for i in indices {
sumRight = sumAll - sumLeft - self[i]
if sumLeft == sumRight {
ret.append(i)
}
sumLeft += self[i]
}
return ret
}
}
let arr = [-7, 1, 5, 2, -4, 3, 0]
print("Equilibrium indexes of \(arr): \(arr.equilibriumIndexes())") | 893Equilibrium index
| 17swift
| p8tbl |
public static boolean isEven(int i){
return (i & 1) == 0;
} | 902Even or odd
| 9java
| n96ih |
null | 904Empty string
| 0go
| ksahz |
function log2 (x) return math.log(x) / math.log(2) end
function entropy (X)
local N, count, sum, i = X:len(), {}, 0
for char = 1, N do
i = X:sub(char, char)
if count[i] then
count[i] = count[i] + 1
else
count[i] = 1
end
end
for n_i, count_i in pairs(count) do
sum = sum + count_i / N * log2(count_i / N)
end
return -sum
end
print(entropy("1223334444")) | 900Entropy
| 1lua
| c7r92 |
function isEven( i ) {
return (i & 1) === 0;
} | 902Even or odd
| 10javascript
| 3ulz0 |
def s = '' | 904Empty string
| 7groovy
| gah46 |
package main
import "fmt"
func halve(i int) int { return i/2 }
func double(i int) int { return i*2 }
func isEven(i int) bool { return i%2 == 0 }
func ethMulti(i, j int) (r int) {
for ; i > 0; i, j = halve(i), double(j) {
if !isEven(i) {
r += j
}
}
return
}
func main() {
fmt.Printf("17 ethiopian 34 =%d\n", ethMulti(17, 34))
} | 901Ethiopian multiplication
| 0go
| c7g9g |
func factorial<T: BinaryInteger>(_ n: T) -> T {
guard n!= 0 else {
return 1
}
return stride(from: n, to: 0, by: -1).reduce(1, *)
}
func binomial<T: BinaryInteger>(_ x: (n: T, k: T)) -> T {
let nFac = factorial(x.n)
let kFac = factorial(x.k)
return nFac / (factorial(x.n - x.k) * kFac)
}
print("binomial(\(5), \(3)) = \(binomial((5, 3)))")
print("binomial(\(20), \(11)) = \(binomial((20, 11)))") | 889Evaluate binomial coefficients
| 17swift
| ks3hx |
import Control.Monad
main = do
let s = ""
when (null s) (putStrLn "Empty.")
when (not $ null s) (putStrLn "Not empty.") | 904Empty string
| 8haskell
| n9zie |
import Prelude hiding (odd)
import Control.Monad (join)
halve :: Int -> Int
halve = (`div` 2)
double :: Int -> Int
double = join (+)
odd :: Int -> Bool
odd = (== 1) . (`mod` 2)
ethiopicmult :: Int -> Int -> Int
ethiopicmult a b =
sum $
map snd $
filter (odd . fst) $
zip (takeWhile (>= 1) $ iterate halve a) (iterate double b)
main :: IO ()
main = print $ ethiopicmult 17 34 == 17 * 34 | 901Ethiopian multiplication
| 8haskell
| p8sbt |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.