jmoy

counters = {key:collections.Counter() for key in ['child','mother','father']}
with open("day2/names.csv") as f:
    rdr = csv.DictReader(f)
    for r in rdr:
        for key in counters:
            l = r[key].split()
            if len(l)>0:
                counters[key][l[0]] += 1
                
commonize = lambda ctr,N: {t[0] for t in ctr.most_common(N)}

jmoy

with open("code/test2.txt") as fin:
    sbj_counts = {}
    for l in fin:
        l = l.strip()
        m = re.fullmatch(r"((?:\w|\.)+)\s+in\s+(\w+)",l)
        if m:
            degree,subject = m.group(1,2)
            print(f"{degree} ({subject})")
            if subject in sbj_counts:
                sbj_counts[subject].add(degree)

jmoy

section ‹A Simple Graph Problem: Second Attempt›

text ‹
We shall prove the following: "In a finite group of people, some of whom are friends with some
of the others there must be at least two people who have the same number of friends."
›

theory Friends
  imports   Main 
            Finite_Set 

jmoy

section ‹A Simple Graph Problem›

text ‹
We shall prove the following: "In a finite group of people, some of whom are friends with some
of the others there must be at least two people who have the same number of friends."
›

theory Friends
  imports   Main 
            Finite_Set 

jmoy

jmoy

import numpy as np
import numpy.random as nr
def gen(N):
    X = nr.choice([0,1],size=N,p=[0.6,0.4])
    D = nr.choice([0,1],size=N,p=[0.6,0.4])
    epsi = nr.uniform(0,2,N)
    Y = X+D*epsi
    return X,D,epsi,Y
    
def estim(D,Y):

jmoy

import itertools as it

NTHUGS = 3
NCASES = 2
BOATCAP = 3

thugs = set()
cases = set()
owner = dict()
nresults = 0

jmoy

# Basic RBC model with full depreciation
# U(c) = log(c)
# F(K) = Z k^\alpha
# where Z is a finite-state Markov chain
#
# Original version:
# Jesus Fernandez-Villaverde
# Haverford, July 3, 2013
# https://github.com/jesusfv/Comparison-Programming-Languages-Economics/blob/master/RBC_Python.py
#

jmoy

{-#LANGUAGE BangPatterns #-}

{-
Enumerate all closed Knight's Tours in an
arbitrarity sized chessboard. Multi-threaded version.

Usage:
    KnightTours m n +RTS -N

Compile with: 

jmoy

/*
A multi-threaded brute-force search for closed Knight's tours (used OpenMP)

Usage: knights_tours [m] [n]
 to search for tour on a m x n board
 rows are denoted by letters A.., columns by numbers 0..

Compile with
  g++ -O3 -Wall -std=c++11 -fopenmp    knight_tours.cc   -o knight_tours