| #!/usr/bin/env python3 | |
| from collections import deque | |
| class Node(object): | |
| def __init__(self): | |
| self.value = None | |
| self.left = None | |
| self.right = None |
`Challenge on Gist`_ from `this Facebook Post`_ provide an interesting question on cracking the NSA encryption. Doesn't this hook you enough? Let's roll. :D
Note, you can also test the validity of logic in this file with the command:
$ python3 -m doctest break_nsa.rst --verbose
| random.int <- function(n) { sample.int(n, 1) } | |
| random.coupon <- function(...) { | |
| count <- 0 | |
| have.coupon <- logical(...) | |
| while (!all(have.coupon)) { | |
| have.coupon[random.int(...)] <- TRUE | |
| count <- count + 1 | |
| } |
| #!/usr/bin/env Rscript | |
| library(rgl) | |
| library(sp) | |
| calc_radian <- function(i, tick, uplim) { | |
| 2 * pi * (i / tick) * (uplim / 360) | |
| } |
| \NeedsTeXFormat{LaTeX2e} | |
| \ProvidesClass{independent-study} | |
| \DeclareOption*{\PassOptionsToClass{\CurrentOption}{book}} | |
| \ProcessOptions\relax | |
| \LoadClass[11pt,a4paper,oneside]{book} | |
| % thai book | |
| \usepackage[english,thai]{babel} |
| array[1..3] of int: divisors = [2, 3, 7]; | |
| var 1..100: answer; | |
| constraint forall(d in divisors)( answer mod d == 0 ); | |
| solve satisfy; | |
| output [ "The ultimate answer is \(answer).\n" ]; |
| #include <iostream> | |
| using namespace std; | |
| bool is_int(string number) { | |
| bool after_dot = false; | |
| for (char c : number) { | |
| if (after_dot and c != '0') { | |
| return false; | |
| } else if (c == '.') { |
