hdf

## bellard.py
import sys
from decimal import Decimal, getcontext

k = int(sys.argv[1]) if len(sys.argv) > 1 else 70

def bellard(n):
  getcontext().prec = n + 1
  return Decimal(1.0/(2**6)) * sum([Decimal(-1)**k/(1024**k) * (Decimal(256)/(10*k+1) + Decimal(1)/(10*k+9) - Decimal(64)/(10*k+3) - Decimal(32)/(4*k+1) - Decimal(4)/(10*k+5) - Decimal(4)/(10*k+7) - Decimal(1)/(4*k+3)) for k in range(n)])

print(bellard(k))

## dirlist.py
import os, sys

cdir = '.'
if len(sys.argv) > 1:
  cdir = sys.argv[1]

for dirname, dirnames, filenames in os.walk(cdir):
  dirname = os.path.realpath(dirname)
  ending = ''
  try:

## combine2len.py
# Usage:
# ---
# python combine2len.py [total_len [num_num_spaces ['words.txt' ['banned.txt']]]]

from itertools import combinations
from pprint import pprint
from sys import argv

def get_combinations(strings, num_strings, total_length):
  result = []

## crc32_quine.cpp
// To compile:
// nvcc -O3 -Xcompiler -openmp crc32_quine.cpp -o crc32_quine

// Inspired by: https://gist.github.com/praetoriansentry/03b6dc2e68e174ffd8168aef7d85f910
// (Can be timed with: http://www.pc-tools.net/win32/ptime/)
// (Was not able to make it faster than the insiration, golang is impressive.)

#include <stdio.h>  // printf, sprintf
#include "Crc32.cpp" // From: https://github.com/stbrumme/crc32

## animate.py
# From: https://gist.github.com/hdf/42f0895a091b4a6a6d5d9eeb5cca8edf

import time, sys, os#, arrow
import numpy as np
import matplotlib
import matplotlib.pyplot as plt
import matplotlib.animation as animation
import matplotlib.colors as colors
import matplotlib.ticker as ticker
import json

## div_hist.py
import sys
import numpy as np
import matplotlib.pyplot as plt

## Recursive divisibility histogram
# How many times can we divide a number by an integer, and by how many integers?
# Divisors start from 2 and increase by 1 until we reach half of the number.
# Show 3D histogram.

n = int(sys.argv[1]) if len(sys.argv) > 1 and sys.argv[1].isdigit() else 180

## q.txt
Chicken and egg dilemma solution:
---
Description of the dilemma:
  What came first, the chicken or the [chicken] egg? (Eggs in general certainly existed before chickens did.)

Statistical approach:
  Almost all chickens lay eggs. But most eggs do not hatch to be chickens. (Most are not fertilized, or it is a rooster that hatches.) Thus it is far more likely for an egg to come from a chicken, (thus chicken coming first) than for a chicken to come from an egg.
Nomenclaturical approach:
  The egg that the first chicken came out of was laid by a proto-chicken. Since it could not be known ahead of time, what would emerge from the egg, it is logical to say, that a proto-chicken lays proto-chicken eggs, even if it is a chicken that emerges from it. Here as well the chicken came first (as it emerged from a proto-chicken egg).
Meta approach:

## index.html
<!DOCTYPE html>
<html lang="en">
<head>
  <meta charset="utf-8">
  <title>Redundancy checker</title>
  <meta name="viewport" content="width=device-width, initial-scale=1">
  <!--<script src="lrs.min.js"></script>-->
<style>
html {
  font-family: 'Verdana', sans-serif;

## conway.py
import string
from sys import argv, stderr
from time import time

def spinner_f():
  while True:
    for c in '|/-\\':
      yield c
spinner = spinner_f()

## dir.py
import os, sys
from datetime import datetime
from zipfile import ZipFile

dir = '.'
out = 'dir.html'

if len(sys.argv) > 1:
  dir = sys.argv[1]
if len(sys.argv) > 2:
	import sys
	from decimal import Decimal, getcontext

	k = int(sys.argv[1]) if len(sys.argv) > 1 else 70

	def bellard(n):
	getcontext().prec = n + 1
	return Decimal(1.0/(2*6)) sum([Decimal(-1)k/(1024k) * (Decimal(256)/(10k+1) + Decimal(1)/(10k+9) - Decimal(64)/(10k+3) - Decimal(32)/(4k+1) - Decimal(4)/(10k+5) - Decimal(4)/(10k+7) - Decimal(1)/(4*k+3)) for k in range(n)])

	print(bellard(k))
	import os, sys

	cdir = '.'
	if len(sys.argv) > 1:
	cdir = sys.argv[1]

	for dirname, dirnames, filenames in os.walk(cdir):
	dirname = os.path.realpath(dirname)
	ending = ''
	try:
	# Usage:
	# ---
	# python combine2len.py [total_len [num_num_spaces ['words.txt' ['banned.txt']]]]

	from itertools import combinations
	from pprint import pprint
	from sys import argv

	def get_combinations(strings, num_strings, total_length):
	result = []
	// To compile:
	// nvcc -O3 -Xcompiler -openmp crc32_quine.cpp -o crc32_quine

	// Inspired by: https://gist.github.com/praetoriansentry/03b6dc2e68e174ffd8168aef7d85f910
	// (Can be timed with: http://www.pc-tools.net/win32/ptime/)
	// (Was not able to make it faster than the insiration, golang is impressive.)

	#include <stdio.h> // printf, sprintf
	#include "Crc32.cpp" // From: https://github.com/stbrumme/crc32
	# From: https://gist.github.com/hdf/42f0895a091b4a6a6d5d9eeb5cca8edf

	import time, sys, os#, arrow
	import numpy as np
	import matplotlib
	import matplotlib.pyplot as plt
	import matplotlib.animation as animation
	import matplotlib.colors as colors
	import matplotlib.ticker as ticker
	import json
	Chicken and egg dilemma solution:
	---
	Description of the dilemma:
	What came first, the chicken or the [chicken] egg? (Eggs in general certainly existed before chickens did.)

	Statistical approach:
	Almost all chickens lay eggs. But most eggs do not hatch to be chickens. (Most are not fertilized, or it is a rooster that hatches.) Thus it is far more likely for an egg to come from a chicken, (thus chicken coming first) than for a chicken to come from an egg.
	Nomenclaturical approach:
	The egg that the first chicken came out of was laid by a proto-chicken. Since it could not be known ahead of time, what would emerge from the egg, it is logical to say, that a proto-chicken lays proto-chicken eggs, even if it is a chicken that emerges from it. Here as well the chicken came first (as it emerged from a proto-chicken egg).
	Meta approach:
	<!DOCTYPE html>
	<html lang="en">
	<head>
	<meta charset="utf-8">
	<title>Redundancy checker</title>
	<meta name="viewport" content="width=device-width, initial-scale=1">
	<!--<script src="lrs.min.js"></script>-->
	<style>
	html {
	font-family: 'Verdana', sans-serif;
	import string
	from sys import argv, stderr
	from time import time

	def spinner_f():
	while True:
	for c in '\|/-\\':
	yield c
	spinner = spinner_f()
	import os, sys
	from datetime import datetime
	from zipfile import ZipFile

	dir = '.'
	out = 'dir.html'

	if len(sys.argv) > 1:
	dir = sys.argv[1]
	if len(sys.argv) > 2: