| """ | |
| Minimal character-level Vanilla RNN model. Written by Andrej Karpathy (@karpathy) | |
| BSD License | |
| """ | |
| import numpy as np | |
| # data I/O | |
| data = open('input.txt', 'r').read() # should be simple plain text file | |
| chars = list(set(data)) | |
| data_size, vocab_size = len(data), len(chars) |
| wget -q -O- http://feeds.serialpodcast.org/serialpodcast | grep -o "<enclosure[ -~][^>]*" | grep -o "http://[ -~][^\"]*" | xargs wget -c |
| def h_index(pubs): | |
| """n-publicaions with at least n-citations""" | |
| # sort the list of citations | |
| pubs = sorted(pubs) | |
| # iterate over the sorted list | |
| for i, x in enumerate(pubs): | |
| # number of citations including this one and greater | |
| n = len(pubs[i:]) | |
| # if this citaiton index is greater than or equal to | |
| # n, we have an h_index |
| import matplotlib.pyplot as plt | |
| import numpy | |
| import random | |
| plt.ion() | |
| fig = plt.figure() | |
| ax = fig.add_subplot(111) | |
| ax.grid(True) |
| import multiprocessing | |
| import os | |
| import sys | |
| import time | |
| import Queue | |
| import threading | |
| from tkwindow import Report | |
| from watchdog import WatchDog | |
| '''Create a print job string for page range by supplying | |
| a total range of pages and an exclude list (such as graphical | |
| pages or ones simply not needed). | |
| Example: | |
| In [1]: from printer_jobs_strings import make_print_string | |
| In [2]: pages = range(0, 25) | |
| In [3]: exclude = [3, 6, 7, 8, 15, 24] | |
| In [4]: make_print_string(pages, exclude) | |
| Out[5]: '0-2,4-5,9-14,16-23' |
| class ReloaderEventHandler(FileSystemEventHandler): | |
| """ | |
| Listen for changes to modules within the Django project | |
| On change, reload the module in the Python Shell | |
| Custom logic required to reload django models.py modules | |
| Due to the singleton AppCache, which caches model references. | |
| For those models files, we must clear and repopulate the AppCache | |
| """ | |
| def __init__(self, *args, **kwargs): |
| /* palindrome.cpp | |
| * C++ implementation of palindrome.py | |
| * (https://gist.github.com/4081368) | |
| * | |
| * - Matthew Martz 2012 | |
| */ | |
| #include <iostream> | |
| #include <string> | |
| #include <sstream> |
| #!/usr/bin/env python | |
| # Google Code Challenge - Credit Problem | |
| # http://code.google.com/codejam/contest/351101/dashboard#s=p0 | |
| import itertools | |
| import bisect | |
| from time import time | |
| def last(array, num): |
We love solving puzzles at Priceonomics. We also like meeting people who like to solve puzzles. Here are two interesting puzzles we've faced at some point in the past months that we'd like to share with you.
If you have any questions, contact omar@priceonomics.com.
