This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
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 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{-#LANGUAGE BangPatterns #-} | |
{- | |
Enumerate all closed Knight's Tours in an | |
arbitrarity sized chessboard. Multi-threaded version. | |
Usage: | |
KnightTours m n +RTS -N | |
Compile with: |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# 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 | |
# |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import itertools as it | |
NTHUGS = 3 | |
NCASES = 2 | |
BOATCAP = 3 | |
thugs = set() | |
cases = set() | |
owner = dict() | |
nresults = 0 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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): |
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
"""Get Wikipedia watchlist as an RSS/ATOM feed | |
(c) Jyotirmoy Bhattacharya, 2007 | |
Usage: wikiwatch <username> <password> [format] | |
[format] is either 'rss' or 'atom' | |
""" | |
import sys | |
import xml.sax,xml.sax.handler |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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) |