I hereby claim:
- I am meehow on github.
- I am meehow (https://keybase.io/meehow) on keybase.
- I have a public key ASC-RyYZx7v1R_c_iB7W8FPluQgtNQU6Q-7ggPPNo45tEQo
To claim this, I am signing this object:
I hereby claim:
To claim this, I am signing this object:
| #!/usr/bin/env python3 | |
| from hashlib import sha1 | |
| import base64 | |
| import time | |
| bold_start = '\033[1m' | |
| bold_end = '\033[0m' | |
| questions = [ |
| package main | |
| import ( | |
| "bufio" | |
| "fmt" | |
| "log" | |
| "os" | |
| "os/exec" | |
| "strings" | |
| "time" |
| -----BEGIN PUBLIC KEY----- | |
| MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEA42W7MuB9/wmAMGktZrWe | |
| WGGNISj95/fazGM9nAJs0c8hsyWyHSUjEK9yETYgL0EbVVwXu4jsh1anaI46Q1h/ | |
| wNYIeZBXKd2Xk+PqSXqd1hIuRtxU4yyWw1wIbtb3OEh2/AfiYvBhTgLBIsI2O56v | |
| gpu6yHueIshRtjF2ES8VGv6eY4/F99kT/Jl/+J6kJjbLqMuk+onpoVUESi3kSs0c | |
| YmnbzbdlZT2wXvhKx5CUBMmiVsQH6gHRZ2ICOjHs6oUKpveS/uVwq03+qAivd4Qo | |
| r7wzMAeVA+enCTatMWr0SWO34gyKv5+i5fgZ80UOids7TX4NwdGp7B5IrR+w14Z4 | |
| wwIDAQAB | |
| -----END PUBLIC KEY----- |
| #!/bin/bash | |
| mkdir -p $2.app/Contents/{MacOS,Resources} | |
| cp $1 $2.app/Contents/MacOS/$2 | |
| cat > $2.app/Contents/Info.plist << EOF | |
| <?xml version="1.0" encoding="UTF-8"?> | |
| <!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd"> | |
| <plist version="1.0"> | |
| <dict> |
| #!/usr/bin/env python3 | |
| import sys | |
| def piwo(ile): | |
| output = 'piw' | |
| if ile == 1: | |
| return output + 'o' | |
| if ile >= 10 and ile <= 20: | |
| return output |
| #!/usr/bin/env python | |
| # coding=utf-8 | |
| import base64 | |
| import cStringIO | |
| import qrcode | |
| import sys | |
| if __name__ == "__main__": | |
| buf = cStringIO.StringIO() | |
| qrcode.make(sys.argv[1], error_correction=qrcode.ERROR_CORRECT_Q, border=1).save(buf) |
| var trackOutboundLink = function(event) { | |
| var url = this.href; | |
| ga('send', 'event', 'outbound', 'click', url, { | |
| 'transport': 'beacon', | |
| 'hitCallback': function(){document.location = url;} | |
| }); | |
| event.preventDefault(); | |
| } | |
| Array.prototype.slice.call(document.getElementsByTagName('a')).map(function(el) { |
| var fs = require('fs'); | |
| function thread(fn) { | |
| var gen = fn(); | |
| function next(err, res) { | |
| var ret = gen.next(res); | |
| if (ret.done) return; | |
| ret.value(next); | |
| } |
| /* Anagram: a little filter that emits anagrams of its argument. | |
| * | |
| * This program's main point of interest is its speed, which it | |
| * obtains by using native FPU operations to do the anagram tests. | |
| * | |
| * The basic idea is to form a one-to-one mapping of letter values to prime | |
| * numbers, allowing words to be represented as composite numbers by | |
| * multiplying together the primes that map each letter in the word. | |
| * Words formed from the same letters, regardless of order, will then map | |
| * to the same composite number. Also, if one word's number divides exactly |