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
if: | |
if: | |
if not: | |
raise | |
if: | |
elif: | |
if not: | |
raise | |
if: | |
elif: |
I hereby claim:
- I am sirpengi on github.
- I am sirpengi (https://keybase.io/sirpengi) on keybase.
- I have a public key whose fingerprint is EF6E FAE9 4D6B CA66 8EA2 4C1F B6BE 3624 D5BC 9DA1
To claim this, I am signing this object:
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
on("ready", function() { | |
var n = +new Date(); | |
var obj = createObj("rollabletable", { | |
name: String(n) | |
}); | |
obj.set("name", "post_" + n); | |
}); |
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
"If the integers from 1 to 999,999,999 are written as | |
words, sorted alphabetically, and concatenated, what | |
is the 51 billionth letter?" | |
To be precise: if the integers from 1 to 999,999,999 | |
are expressed in words (omitting spaces, 'and', and | |
punctuation[1]), and sorted alphabetically so that | |
the first six integers are | |
eight |
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
[sirpengi@localhost tmp]$ python anagrams.py | |
############# (1.31171178818) | |
################ (1.60090017319) | |
################### (1.9009168148) | |
###################### (2.23292398453) | |
######################### (2.55905890465) |
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
from collections import Counter | |
with open("/usr/share/dict/words") as fh: | |
solutions = {} | |
for i, line in enumerate(fh.readlines()): | |
if i > 100000: | |
break | |
w = line.lower().strip() | |
h = tuple(sorted(Counter(w).elements())) | |
if h not in solutions: | |
solutions[h] = 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
DoExpressCheckoutPayment failed: | |
{ | |
'ACK': 'Failure', | |
'TIMESTAMP': '2013-11-26T03:18:22Z', | |
'L_SEVERITYCODE0': 'Error', | |
'L_SHORTMESSAGE0': 'Transaction refused because of an invalid argument. See additional error messages for details.', | |
'L_LONGMESSAGE0': 'A successful transaction has already been completed for this token.', | |
... | |
} |
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
500 Internal Server Error | |
Sorry, something went wrong. | |
A team of highly trained monkeys has been dispatched to deal with this situation. | |
If you see them, show them this information: | |
q8tvTqOwLT5ji9a9wG0Llddj-MDpqyJ1XouR3hxmRuTNbNcu_KX36T9aJ2fw | |
iI0gqMVvBdrg-N1MWH8UZazCKQlx2BQ-Q8c356TX-pioVoQgyfyHoLcvHJOn | |
7Va6HYO_aRWC0Y1oYX1ael5_BrqOBS-G87TTPZijllTyuswFiilV20k9ICve |
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
(ns diagonal-sum) | |
(defn ds-step [[v prev step]] | |
[(+ v (* 4 prev) (* 10 step)) (+ prev (* 4 step)) (+ step 2)]) | |
(defn ds-seq [] | |
(map first (iterate ds-step [1 1 2]))) | |
(println (take 10 (ds-seq))) |