code stringlengths 1 46.1k ⌀ | label class label 1.18k
classes | domain_label class label 21
classes | index stringlengths 4 5 |
|---|---|---|---|
null | 442Permutations by swapping | 17swift | yxr6e |
user=> (require 'clojure.contrib.combinatorics)
nil
user=> (clojure.contrib.combinatorics/permutations [1 2 3])
((1 2 3) (1 3 2) (2 1 3) (2 3 1) (3 1 2) (3 2 1)) | 456Permutations | 6clojure | vo92f |
public func totient(n: Int) -> Int {
var n = n
var i = 2
var tot = n
while i * i <= n {
if n% i == 0 {
while n% i == 0 {
n /= i
}
tot -= tot / i
}
if i == 2 {
i = 1
}
i += 2
}
if n > 1 {
tot -= tot / n
}
return tot
}
public struct PerfectTot... | 450Perfect totient numbers | 17swift | 6w93j |
null | 443Pi | 11kotlin | 2okli |
use Image::Imlib2;
my $img1 = Image::Imlib2->load('Lenna50.jpg') || die;
my $img2 = Image::Imlib2->load('Lenna100.jpg') || die;
my $w = $img1->width;
my $h = $img1->height;
my $sum = 0;
for my $x (0..$w-1) {
for my $y (0..$h-1) {
my ($r1, $g1, $b1) = $img1->query_pixel($x, $y);
my ($r2, $g2, $b... | 453Percentage difference between images | 2perl | t1tfg |
import Foundation
struct Perlin {
private static let permutation = [
151, 160, 137, 91, 90, 15, 131, 13, 201, 95, 96, 53, 194, 233, 7, 225,
140, 36, 103, 30, 69, 142, 8, 99, 37, 240, 21, 10, 23, 190, 6, 148,
247, 120, 234, 75, 0, 26, 197, 62, 94, 252, 219, 203, 117, 35, 11, ... | 445Perlin noise | 17swift | vih2r |
suits = {"Clubs", "Diamonds", "Hearts", "Spades"}
faces = {2,3,4,5,6,7,8,9,10,"Jack","Queen","King","Ace"} | 438Playing cards | 1lua | 8720e |
use rand::prelude::*;
fn main() {
println!("Beginning game of Pig...");
let mut players = vec![
Player::new(String::from("PLAYER (1) ONE")),
Player::new(String::from("PLAYER (2) TWO")),
];
'game: loop {
for player in players.iter_mut() {
if player.cont() {
... | 434Pig the dice game | 15rust | rzdg5 |
from itertools import permutations
import math
def derangements(n):
'All deranged permutations of the integers 0..n-1 inclusive'
return ( perm for perm in permutations(range(n))
if all(indx != p for indx, p in enumerate(perm)) )
def subfact(n):
if n == 2 or n == 0:
return 1
elif ... | 444Permutations/Derangements | 3python | ojy81 |
object PigDice extends App {
private val (maxScore, nPlayers) = (100, 2)
private val rnd = util.Random
private case class Game(gameOver: Boolean, idPlayer: Int, score: Int, stickedScores: Vector[Int])
@scala.annotation.tailrec
private def loop(play: Game): Unit =
play match {
case Game(true, _, _,... | 434Pig the dice game | 16scala | hyzja |
str =
puts str.reverse
puts str.split.map(&:reverse).join()
puts str.split.reverse.join() | 437Phrase reversals | 14ruby | vix2n |
fn reverse_string(string: &str) -> String {
string.chars().rev().collect::<String>()
}
fn reverse_words(string: &str) -> String {
string
.split_whitespace()
.map(|x| x.chars().rev().collect::<String>())
.collect::<Vec<String>>()
.join(" ")
}
fn reverse_word_order(string: &str) ... | 437Phrase reversals | 15rust | unqvj |
bool isPerfect(int n){ | 455Perfect numbers | 18dart | tpnfa |
use List::Util qw(all);
sub perfect_shuffle {
my $mid = @_ / 2;
map { @_[$_, $_ + $mid] } 0..($mid - 1);
}
for my $size (8, 24, 52, 100, 1020, 1024, 10000) {
my @shuffled = my @deck = 1 .. $size;
my $n = 0;
do { $n++; @shuffled = perfect_shuffle(@shuffled) }
until all { $shuffled[$_] == $de... | 452Perfect shuffle | 2perl | q4sx6 |
a = {}
n = 1000
len = math.modf( 10 * n / 3 )
for j = 1, len do
a[j] = 2
end
nines = 0
predigit = 0
for j = 1, n do
q = 0
for i = len, 1, -1 do
x = 10 * a[i] + q * i
a[i] = math.fmod( x, 2 * i - 1 )
q = math.modf( x / ( 2 * i - 1 ) )
end
a[1] = math.fmod( q, 10 )
q = mat... | 443Pi | 1lua | vib2x |
>>> import random
>>> random.choice(['foo', 'bar', 'baz'])
'baz' | 436Pick random element | 3python | 9samf |
object PhraseReversals extends App {
val phrase = scala.io.StdIn.readLine
println(phrase.reverse)
println(phrase.split(' ').map(_.reverse).mkString(" "))
println(phrase.split(' ').reverse.mkString(" "))
} | 437Phrase reversals | 16scala | gt84i |
from PIL import Image
i1 = Image.open()
i2 = Image.open()
assert i1.mode == i2.mode,
assert i1.size == i2.size,
pairs = zip(i1.getdata(), i2.getdata())
if len(i1.getbands()) == 1:
dif = sum(abs(p1-p2) for p1,p2 in pairs)
else:
dif = sum(abs(c1-c2) for p1,p2 in pairs for c1,c2 in zip(p1,p2))
ncomponent... | 453Percentage difference between images | 3python | zaztt |
sub is_pernicious {
my $n = shift;
my $c = 2693408940;
while ($n) { $c >>= 1; $n &= ($n - 1); }
$c & 1;
}
my ($i, @p) = 0;
while (@p < 25) {
push @p, $i if is_pernicious($i);
$i++;
}
print join ' ', @p;
print "\n";
($i, @p) = (888888877,);
while ($i < 888888888) {
push @p, $i if is_perni... | 441Pernicious numbers | 2perl | nk2iw |
letters
sample(letters, 1)
paste(sample(letters, 10, rep=T), collapse="") | 436Pick random element | 13r | 3ekzt |
import doctest
import random
def flatten(lst):
return [i for sublst in lst for i in sublst]
def magic_shuffle(deck):
half = len(deck)
return flatten(zip(deck[:half], deck[half:]))
def after_how_many_is_equal(shuffle_type,start,end):
start = shuffle_type(start)
counter = 1
wh... | 452Perfect shuffle | 3python | sg0q9 |
func reverseString(s:String)->String{
var temp = [Character]()
for i in s.characters{
temp.append(i)
}
var j=s.characters.count-1
for i in s.characters{
temp[j]=i
j-=1
}
return String(temp)
}
func reverseWord(s:String)->String{
var temp = [Character]()
var r... | 437Phrase reversals | 17swift | 2owlj |
wave.shuffle <- function(n) {
deck <- 1:n
new.deck <- c(matrix(data = deck, ncol = 2, byrow = TRUE))
counter <- 1
while (!identical(deck, new.deck)) {
new.deck <- c(matrix(data = new.deck, ncol = 2, byrow = TRUE))
counter <- counter + 1
}
return(counter)
}
test.values <- c(8, 24, 52, 10... | 452Perfect shuffle | 13r | evwad |
def derangements(n)
ary = (1 .. n).to_a
ary.permutation.select do |perm|
ary.zip(perm).all? {|a,b| a!= b}
end
end
def subfact(n)
case n
when 0 then 1
when 1 then 0
else (n-1)*(subfact(n-1) + subfact(n-2))
end
end
puts
derangements(4).each{|d|p d}
puts
(0..9).each do |n|
puts % [n, derangemen... | 444Permutations/Derangements | 14ruby | nk9it |
require 'raster_graphics'
class RGBColour
def -(a_colour)
(@red - a_colour.red).abs +
(@green - a_colour.green).abs +
(@blue - a_colour.blue).abs
end
end
class Pixmap
def -(a_pixmap)
if @width!= a_pixmap.width or @height!= a_pixmap.height
raise ArgumentError,
end
sum = 0
... | 453Percentage difference between images | 14ruby | 6w63t |
%w(north east south west).sample
(1..100).to_a.sample(2) | 436Pick random element | 14ruby | l8wcl |
def derangements(n: Int) =
(1 to n).permutations.filter(_.zipWithIndex.forall{case (a, b) => a - b != 1})
def subfactorial(n: Long): Long = n match {
case 0 => 1
case 1 => 0
case _ => (n - 1) * (subfactorial(n - 1) + subfactorial(n - 2))
}
println(s"Derangements for n = 4")
println(derangements(4) mkString "\... | 444Permutations/Derangements | 16scala | zavtr |
extern crate image;
use image::{GenericImageView, Rgba};
fn diff_rgba3(rgba1: Rgba<u8>, rgba2: Rgba<u8>) -> i32 {
(rgba1[0] as i32 - rgba2[0] as i32).abs()
+ (rgba1[1] as i32 - rgba2[1] as i32).abs()
+ (rgba1[2] as i32 - rgba2[2] as i32).abs()
}
fn main() {
let img1 = image::open("Lenna100.jpg").unwr... | 453Percentage difference between images | 15rust | yxy68 |
extern crate rand;
use rand::Rng;
fn main() {
let array = [5,1,2,5,6,7,8,1,2,4,5];
let mut rng = rand::thread_rng();
println!("{}", rng.choose(&array).unwrap());
} | 436Pick random element | 15rust | 2oxlt |
func pixelValues(fromCGImage imageRef: CGImage?) -> [UInt8]?
{
var width = 0
var height = 0
var pixelValues: [UInt8]?
if let imageRef = imageRef {
width = imageRef.width
height = imageRef.height
let bitsPerComponent = imageRef.bitsPerComponent
let bytesPerRow = imageRef.... | 453Percentage difference between images | 17swift | 3e3z2 |
def perfect_shuffle(deck_size = 52)
deck = (1..deck_size).to_a
original = deck.dup
half = deck_size / 2
1.step do |i|
deck = deck.first(half).zip(deck.last(half)).flatten
return i if deck == original
end
end
[8, 24, 52, 100, 1020, 1024, 10000].each {|i| puts } | 452Perfect shuffle | 14ruby | 87o01 |
extern crate itertools;
fn shuffle<T>(mut deck: Vec<T>) -> Vec<T> {
let index = deck.len() / 2;
let right_half = deck.split_off(index);
itertools::interleave(deck, right_half).collect()
}
fn main() {
for &size in &[8, 24, 52, 100, 1020, 1024, 10_000] {
let original_deck: Vec<_> = (0..size).col... | 452Perfect shuffle | 15rust | oji83 |
val a = (1 to 10).toList
println(scala.util.Random.shuffle(a).head) | 436Pick random element | 16scala | 5d0ut |
object PerfectShuffle extends App {
private def sizes = Seq(8, 24, 52, 100, 1020, 1024, 10000)
private def perfectShuffle(size: Int): Int = {
require(size % 2 == 0, "Card deck must be even")
val (half, a) = (size / 2, Array.range(0, size))
val original = a.clone
var count = 1
while (true) {
... | 452Perfect shuffle | 16scala | dbfng |
>>> def popcount(n): return bin(n).count()
>>> primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61}
>>> p, i = [], 0
>>> while len(p) < 25:
if popcount(i) in primes: p.append(i)
i += 1
>>> p
[3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 17, 18, 19, 20, 21, 22, 24, 25, 26, 28, 31, 33, 3... | 441Pernicious numbers | 3python | dbvn1 |
func perfectShuffle<T>(_ arr: [T]) -> [T]? {
guard arr.count & 1 == 0 else {
return nil
}
let half = arr.count / 2
var res = [T]()
for i in 0..<half {
res.append(arr[i])
res.append(arr[i + half])
}
return res
}
let decks = [
Array(1...8),
Array(1...24),
Array(1...52),
Array(1...100... | 452Perfect shuffle | 17swift | 0r8s6 |
package Playing_Card_Deck;
use strict;
@Playing_Card_Deck::suits = qw
[Diamonds Clubs Hearts Spades];
@Playing_Card_Deck::pips = qw
[Two Three Four Five Six Seven Eight Nine Ten
Jack King Queen Ace];
sub new
{my $invocant = shift;
my $class = ref($invocant) || $invocant;
my @cards = ();
foreach... | 438Playing cards | 2perl | 5dqu2 |
import Darwin
let myList = [1, 2, 4, 5, 62, 234, 1, -1]
print(myList[Int(arc4random_uniform(UInt32(myList.count)))]) | 436Pick random element | 17swift | c0e9t |
class Card
{
protected static $suits = array( '', '', '', '' );
protected static $pips = array( '2', '3', '4', '5', '6', '7', '8', '9', 'T', 'J', 'Q', 'K', 'A' );
protected $suit;
protected $suitOrder;
protected $pip;
protected $pipOrder;
protected $order;
public function __c... | 438Playing cards | 12php | ojv85 |
null | 443Pi | 17swift | 87y0v |
require
class Integer
def popcount
to_s(2).count()
end
def pernicious?
popcount.prime?
end
end
p 1.step.lazy.select(&:pernicious?).take(25).to_a
p ( 888888877..888888888).select(&:pernicious?) | 441Pernicious numbers | 14ruby | t15f2 |
extern crate aks_test_for_primes;
use std::iter::Filter;
use std::ops::RangeFrom;
use aks_test_for_primes::is_prime;
fn main() {
for i in pernicious().take(25) {
print!("{} ", i);
}
println!();
for i in (888_888_877u64..888_888_888).filter(is_pernicious) {
print!("{} ", i);
}
}
f... | 441Pernicious numbers | 15rust | za4to |
package main
import "fmt"
func computePerfect(n int64) bool {
var sum int64
for i := int64(1); i < n; i++ {
if n%i == 0 {
sum += i
}
}
return sum == n
} | 455Perfect numbers | 0go | e2pa6 |
sub pistream {
my $digits = shift;
my(@out, @a);
my($b, $c, $d, $e, $f, $g, $i, $d4, $d3, $d2, $d1);
my $outi = 0;
$digits++;
$b = $d = $e = $g = $i = 0;
$f = 10000;
$c = 14 * (int($digits/4)+2);
@a = (20000000) x $c;
print "3.";
while (($b = $c -= 14) > 0 && $i < $digits) {
$d = $e = $d % $f... | 443Pi | 2perl | sg3q3 |
def isPernicious( v:Long ) : Boolean = BigInt(v.toBinaryString.toList.filter( _ == '1' ).length).isProbablePrime(16) | 441Pernicious numbers | 16scala | yx763 |
def isPerfect = { n ->
n > 4 && (n == (2..Math.sqrt(n)).findAll { n % it == 0 }.inject(1) { factorSum, i -> factorSum += i + n/i })
} | 455Perfect numbers | 7groovy | ky7h7 |
perfect n =
n == sum [i | i <- [1..n-1], n `mod` i == 0] | 455Perfect numbers | 8haskell | 3afzj |
import random
class Card(object):
suits = (,,,)
pips = (,,,,,,,,,,,,)
def __init__(self, pip,suit):
self.pip=pip
self.suit=suit
def __str__(self):
return %(self.pip,self.suit)
class Deck(object):
def __init__(self):
self.deck = [Card(pip,suit) for suit in Card.sui... | 438Playing cards | 3python | 4fs5k |
import Foundation
extension BinaryInteger {
@inlinable
public var isPrime: Bool {
if self == 0 || self == 1 {
return false
} else if self == 2 {
return true
}
let max = Self(ceil((Double(self).squareRoot())))
for i in stride(from: 2, through: max, by: 1) where self% i == 0 {
... | 441Pernicious numbers | 17swift | fpudk |
public static boolean perf(int n){
int sum= 0;
for(int i= 1;i < n;i++){
if(n % i == 0){
sum+= i;
}
}
return sum == n;
} | 455Perfect numbers | 9java | ij0os |
package main
import "fmt"
func main() {
demoPerm(3)
}
func demoPerm(n int) { | 456Permutations | 0go | alk1f |
function is_perfect(n)
{
var sum = 1, i, sqrt=Math.floor(Math.sqrt(n));
for (i = sqrt-1; i>1; i--)
{
if (n % i == 0) {
sum += i + n/i;
}
}
if(n % sqrt == 0)
sum += sqrt + (sqrt*sqrt == n ? 0 : n/sqrt);
return sum === n;
}
var i;
for (i = 1; i < 10000; i++)
{
if (is_perfect(i))
print(i);
} | 455Perfect numbers | 10javascript | z1dt2 |
def makePermutations = { l -> l.permutations() } | 456Permutations | 7groovy | h6gj9 |
pips <- c("2", "3", "4", "5", "6", "7", "8", "9", "10", "Jack", "Queen", "King", "Ace")
suit <- c("Clubs", "Diamonds", "Hearts", "Spades")
deck <- data.frame(pips=rep(pips, 4), suit=rep(suit, each=13))
shuffle <- function(deck)
{
n <- nrow(deck)
ord <- sample(seq_len(n), size=n)
deck[ord,]
}
deal <- functio... | 438Playing cards | 13r | 2oelg |
import Data.List (permutations)
main = mapM_ print (permutations [1,2,3]) | 456Permutations | 8haskell | z1nt0 |
def calcPi():
q, r, t, k, n, l = 1, 0, 1, 1, 3, 3
while True:
if 4*q+r-t < n*t:
yield n
nr = 10*(r-n*t)
n = ((10*(3*q+r))
q *= 10
r = nr
else:
nr = (2*q+r)*l
nn = (q*(7*k)+2+(r*l))
q *= k
... | 443Pi | 3python | 0r6sq |
null | 455Perfect numbers | 11kotlin | q5ex1 |
public class PermutationGenerator {
private int[] array;
private int firstNum;
private boolean firstReady = false;
public PermutationGenerator(int n, int firstNum_) {
if (n < 1) {
throw new IllegalArgumentException("The n must be min. 1");
}
firstNum = firstNum_;
... | 456Permutations | 9java | o7q8d |
suppressMessages(library(gmp))
ONE <- as.bigz("1")
TWO <- as.bigz("2")
THREE <- as.bigz("3")
FOUR <- as.bigz("4")
SEVEN <- as.bigz("7")
TEN <- as.bigz("10")
q <- as.bigz("1")
r <- as.bigz("0")
t <- as.bigz("1")
k <- as.bigz("1")
n <- as.bigz("3")
l <- as.bigz("3")
char_printed <- 0
how_many <- 1000
first <- TRUE
wh... | 443Pi | 13r | wufe5 |
<html><head><title>Permutations</title></head>
<body><pre id="result"></pre>
<script type="text/javascript">
var d = document.getElementById('result');
function perm(list, ret)
{
if (list.length == 0) {
var row = document.createTextNode(ret.join(' ') + '\n');
d.appendChild(row);
return;
... | 456Permutations | 10javascript | tpifm |
class Card
SUITS = %i[ Clubs Hearts Spades Diamonds ]
PIPS = %i[ 2 3 4 5 6 7 8 9 10 Jack Queen King Ace ]
@@suit_value = Hash[ SUITS.each_with_index.to_a ]
@@pip_value = Hash[ PIPS.each_with_index.to_a ]
attr_reader :pip, :suit
def initialize(pip,suit)
@pip = pip
@suit = suit
end
def... | 438Playing cards | 14ruby | rz8gs |
function isPerfect(x)
local sum = 0
for i = 1, x-1 do
sum = (x % i) == 0 and sum + i or sum
end
return sum == x
end | 455Perfect numbers | 1lua | s4wq8 |
extern crate rand;
use std::fmt;
use rand::Rng;
use Pip::*;
use Suit::*;
#[derive(Copy, Clone, Debug)]
enum Pip { Ace, Two, Three, Four, Five, Six, Seven, Eight, Nine, Ten, Jack, Queen, King }
#[derive(Copy, Clone, Debug)]
enum Suit { Spades, Hearts, Diamonds, Clubs }
struct Card {
pip: Pip,
suit: Suit
}
impl fm... | 438Playing cards | 15rust | 73orc |
import scala.annotation.tailrec
import scala.util.Random
object Pip extends Enumeration {
type Pip = Value
val Two, Three, Four, Five, Six, Seven, Eight, Nine, Ten, Jack, Queen, King, Ace = Value
}
object Suit extends Enumeration {
type Suit = Value
val Diamonds, Spades, Hearts, Clubs = Value
}
import Suit._... | 438Playing cards | 16scala | kmdhk |
pi_digits = Enumerator.new do |y|
q, r, t, k, n, l = 1, 0, 1, 1, 3, 3
loop do
if 4*q+r-t < n*t
y << n
nr = 10*(r-n*t)
n = ((10*(3*q+r)) / t) - 10*n
q *= 10
r = nr
else
nr = (2*q+r) * l
nn = (q*(7*k+2)+r*l) / (t*l)
q *= k
t *= l
l += 2
k += 1... | 443Pi | 14ruby | ojm8v |
null | 456Permutations | 11kotlin | xu1ws |
use num_bigint::BigInt;
fn main() {
calc_pi();
}
fn calc_pi() {
let mut q = BigInt::from(1);
let mut r = BigInt::from(0);
let mut t = BigInt::from(1);
let mut k = BigInt::from(1);
let mut n = BigInt::from(3);
let mut l = BigInt::from(3);
let mut first = true;
loop {
if &q *... | 443Pi | 15rust | ih9od |
object Pi {
class PiIterator extends Iterable[BigInt] {
var r: BigInt = 0
var q, t, k: BigInt = 1
var n, l: BigInt = 3
def iterator: Iterator[BigInt] = new Iterator[BigInt] {
def hasNext = true
def next(): BigInt = {
while ((4 * q + r - t) >= (n * t)) {
val nr = (2 * q ... | 443Pi | 16scala | fp2d4 |
import Foundation | 438Playing cards | 17swift | gt049 |
local function permutation(a, n, cb)
if n == 0 then
cb(a)
else
for i = 1, n do
a[i], a[n] = a[n], a[i]
permutation(a, n - 1, cb)
a[i], a[n] = a[n], a[i]
end
end
end | 456Permutations | 1lua | q5ax0 |
type AnyWriteableObject={write:((textToOutput:string)=>any)};
function calcPi(pipe:AnyWriteableObject) {
let q = 1n, r=0n, t=1n, k=1n, n=3n, l=3n;
while (true) {
if (q * 4n + r - t < n* t) {
pipe.write(n.toString());
let nr = (r - n * t) * 10n;
n = (q * 3n + r) * 10... | 443Pi | 20typescript | l8hc8 |
sub perf {
my $n = shift;
my $sum = 0;
foreach my $i (1..$n-1) {
if ($n % $i == 0) {
$sum += $i;
}
}
return $sum == $n;
} | 455Perfect numbers | 2perl | voc20 |
function is_perfect($number)
{
$sum = 0;
for($i = 1; $i < $number; $i++)
{
if($number % $i == 0)
$sum += $i;
}
return $sum == $number;
}
echo . PHP_EOL;
for($num = 1; $num < 33550337; $num++)
{
if(is_perfect($num))
echo $num . PHP_EOL;
} | 455Perfect numbers | 12php | 0gxsp |
def perf1(n):
sum = 0
for i in range(1, n):
if n% i == 0:
sum += i
return sum == n | 455Perfect numbers | 3python | uilvd |
is.perf <- function(n){
if (n==0|n==1) return(FALSE)
s <- seq (1,n-1)
x <- n%% s
m <- data.frame(s,x)
out <- with(m, s[x==0])
return(sum(out)==n)
}
is.perf(28)
sapply(c(6,28,496,8128,33550336),is.perf) | 455Perfect numbers | 13r | csy95 |
int main(){
char colourNames[][14] = { , , , , , , , , ,
, , , , , , };
int stroke=0,fill=0,back=0,i;
double centerX = 300,centerY = 300,coreSide,armLength,pentaLength;
printf();
scanf(,&coreSide);
printf();
scanf(,&armLength);
printf();
for(i=0;i<16;i++){
printf(,i+1,colourNames[i]);
... | 457Pentagram | 5c | 4dl5t |
def perf(n)
sum = 0
for i in 1...n
sum += i if n % i == 0
end
sum == n
end | 455Perfect numbers | 14ruby | 4dv5p |
package main
import (
"github.com/fogleman/gg"
"math"
)
func Pentagram(x, y, r float64) []gg.Point {
points := make([]gg.Point, 5)
for i := 0; i < 5; i++ {
fi := float64(i)
angle := 2*math.Pi*fi/5 - math.Pi/2
points[i] = gg.Point{x + r*math.Cos(angle), y + r*math.Sin(angle)}
... | 457Pentagram | 0go | o7x8q |
fn main ( ) {
fn factor_sum(n: i32) -> i32 {
let mut v = Vec::new(); | 455Perfect numbers | 15rust | gfu4o |
pentagram -w 400 -o pentagram_hs.svg | 457Pentagram | 8haskell | 28yll |
import java.awt.*;
import java.awt.geom.Path2D;
import javax.swing.*;
public class Pentagram extends JPanel {
final double degrees144 = Math.toRadians(144);
public Pentagram() {
setPreferredSize(new Dimension(640, 640));
setBackground(Color.white);
}
private void drawPentagram(Graphi... | 457Pentagram | 9java | 6ed3z |
def perfectInt(input: Int) = ((2 to sqrt(input).toInt).collect {case x if input % x == 0 => x + input / x}).sum == input - 1 | 455Perfect numbers | 16scala | j3g7i |
null | 457Pentagram | 11kotlin | dk0nz |
struct Pair {
uint64_t v1, v2;
};
struct Pair makePair(uint64_t a, uint64_t b) {
struct Pair r;
r.v1 = a;
r.v2 = b;
return r;
}
struct Pair solvePell(int n) {
int x = (int) sqrt(n);
if (x * x == n) {
return makePair(1, 0);
} else {
int y = x;
... | 458Pell's equation | 5c | 5n9uk |
local cos, sin, floor, pi = math.cos, math.sin, math.floor, math.pi
function Bitmap:render()
for y = 1, self.height do
print(table.concat(self.pixels[y]))
end
end
function Bitmap:pentagram(x, y, radius, rotation, outlcolor, fillcolor)
local function pxy(i) return x+radius*cos(i*pi*2/5+rotation), y+radius*si... | 457Pentagram | 1lua | fb8dp |
sub permutation {
my ($perm,@set) = @_;
print "$perm\n" || return unless (@set);
permutation($perm.$set[$_],@set[0..$_-1],@set[$_+1..$
}
my @input = (qw/a b c d/);
permutation('',@input); | 456Permutations | 2perl | 28mlf |
func perfect(n:Int) -> Bool {
var sum = 0
for i in 1..<n {
if n% i == 0 {
sum += i
}
}
return sum == n
}
for i in 1..<10000 {
if perfect(i) {
println(i)
}
} | 455Perfect numbers | 17swift | 5n2u8 |
use SVG;
my $tau = 2 * 4*atan2(1, 1);
my $dim = 200;
my $sides = 5;
for $v (0, 2, 4, 1, 3, 0) {
push @vx, 0.9 * $dim * cos($tau * $v / $sides);
push @vy, 0.9 * $dim * sin($tau * $v / $sides);
}
my $svg= SVG->new( width => 2*$dim, height => 2*$dim);
my $points = $svg->get_path(
x => \@vx,
y ... | 457Pentagram | 2perl | j357f |
package main
import (
"fmt"
"math/big"
)
var big1 = new(big.Int).SetUint64(1)
func solvePell(nn uint64) (*big.Int, *big.Int) {
n := new(big.Int).SetUint64(nn)
x := new(big.Int).Set(n)
x.Sqrt(x)
y := new(big.Int).Set(x)
z := new(big.Int).SetUint64(1)
r := new(big.Int).Lsh(x, 1)
e1... | 458Pell's equation | 0go | 8re0g |
import turtle
turtle.bgcolor()
t = turtle.Turtle()
t.color(, )
t.begin_fill()
for i in range(0, 5):
t.forward(200)
t.right(144)
t.end_fill() | 457Pentagram | 3python | h64jw |
pell :: Integer -> (Integer, Integer)
pell n = go (x, 1, x * 2, 1, 0, 0, 1)
where
x = floor $ sqrt $ fromIntegral n
go (y, z, r, e1, e2, f1, f2) =
let y' = r * z - y
z' = (n - y' * y') `div` z
r' = (x + y') `div` z'
(e1', e2') = (e2, e2 * r' + e1)
(f1', f2') = (f2... | 458Pell's equation | 8haskell | l03ch |
p <- cbind(x = c(0, 1, 2,-0.5 , 2.5 ,0),
y = c(0, 1, 0,0.6, 0.6,0))
plot(p)
lines(p) | 457Pentagram | 13r | gf247 |
void Peano(int x, int y, int lg, int i1, int i2) {
if (lg == 1) {
lineto(3*x,3*y);
return;
}
lg = lg/3;
Peano(x+(2*i1*lg), y+(2*i1*lg), lg, i1, i2);
Peano(x+((i1-i2+1)*lg), y+((i1+i2)*lg), lg, i1, 1-i2);
Peano(x+lg, y+lg, lg, i1, 1-i2);
Peano(x+((i1+i2)*lg), y+((i1-i2+1)*lg), lg, 1-i1, 1-i2);
Peano(x+(2*i... | 459Peano curve | 5c | q5bxc |
int getseq(char *s)
{
int r = 0;
int i = 1 << (SEQLEN - 1);
while (*s && i) {
switch (*s++) {
case 'H':
case 'h':
r |= i;
break;
case 'T':
case 't':
break;
default:
... | 460Penney's game | 5c | 3a8za |
void firstCase(){
mpf_t a,b,c;
mpf_inits(a,b,c,NULL);
mpf_set_str(a,,10);
mpf_set_str(b,,10);
mpf_add(c,a,b);
gmp_printf(,20,c);
}
void pathologicalSeries(){
int n;
mpf_t v1, v2, vn, a1, a2, a3, t2, t3, prod;
mpf_inits(v1,v2,vn, a1, a2, a3, t2, t3, prod,NULL);
mpf_set_str(v1,,10);
mpf_set_str(v2,,10);
... | 461Pathological floating point problems | 5c | rt9g7 |
import java.math.BigInteger;
import java.text.NumberFormat;
import java.util.ArrayList;
import java.util.List;
public class PellsEquation {
public static void main(String[] args) {
NumberFormat format = NumberFormat.getInstance();
for ( int n : new int[] {61, 109, 181, 277, 8941} ) {
B... | 458Pell's equation | 9java | 3aizg |
(def converge-to-six ((fn task1 [a b] (lazy-seq (cons a (task1 b (+ (- 111 (/ 1130 b)) (/ 3000 (* b a))))))) 2 -4))
(def values [3 4 5 6 7 8 20 30 50 100])
(pprint (sort (zipmap values (map double (map #(nth converge-to-six (dec %)) values)))))
(pprint (sort (zipmap values (map #(nth converge-to-six (dec %)) values))... | 461Pathological floating point problems | 6clojure | bmukz |
import java.math.BigInteger
import kotlin.math.sqrt
class BIRef(var value: BigInteger) {
operator fun minus(b: BIRef): BIRef {
return BIRef(value - b.value)
}
operator fun times(b: BIRef): BIRef {
return BIRef(value * b.value)
}
override fun equals(other: Any?): Boolean {
... | 458Pell's equation | 11kotlin | nhqij |
import java.awt._
import java.awt.geom.Path2D
import javax.swing._
object Pentagram extends App {
SwingUtilities.invokeLater(() =>
new JFrame("Pentagram") {
class Pentagram extends JPanel {
setPreferredSize(new Dimension(640, 640))
setBackground(Color.white)
final private val deg... | 457Pentagram | 16scala | e2kab |
import itertools
for values in itertools.permutations([1,2,3]):
print (values) | 456Permutations | 3python | vo929 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.