Skip to content

Instantly share code, notes, and snippets.

Avatar
💤
procrastinating

Nattawut Phetmak neizod

💤
procrastinating
View GitHub Profile
View mersenne-twister.ipynb
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
View 0-1-check_int.cpp
#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 == '.') {
@neizod
neizod / LICENSE.txt
Last active Apr 27, 2019 — forked from 140bytes/LICENSE.txt
Fibonacci (Recursive Lambda)
View LICENSE.txt
DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
Version 2, December 2004
Copyright (C) 2012 Nattawut Phetmak <http://about.me/neizod>
Everyone is permitted to copy and distribute verbatim or modified
copies of this license document, and changing it is allowed as long
as the name is changed.
DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
@neizod
neizod / answer-final.mzn
Last active Nov 26, 2018
MiniZinc examples for Blognone.
View answer-final.mzn
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" ];
View smallest-circle.ipynb
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
View informal-template.cls
\NeedsTeXFormat{LaTeX2e}
\ProvidesClass{independent-study}
\DeclareOption*{\PassOptionsToClass{\CurrentOption}{book}}
\ProcessOptions\relax
\LoadClass[11pt,a4paper,oneside]{book}
% thai book
\usepackage[english,thai]{babel}
@neizod
neizod / draw-cubic-ufo.R
Last active May 25, 2018
3D drawing script for explaining how to solve Google Code Jam, 2018 Qualification, Cubic UFO.
View draw-cubic-ufo.R
#!/usr/bin/env Rscript
library(rgl)
library(sp)
calc_radian <- function(i, tick, uplim) {
2 * pi * (i / tick) * (uplim / 360)
}
@neizod
neizod / coupon.R
Last active Jul 16, 2017
R Program That Draw Histogram of Coupon's Collector Problem
View coupon.R
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
}
View keybase.md

Keybase proof

I hereby claim:

  • I am neizod on github.
  • I am neizod (https://keybase.io/neizod) on keybase.
  • I have a public key whose fingerprint is 48AB A6A9 A002 DCD8 6E24 DFB0 0E27 2831 8C9B 4947

To claim this, I am signing this object:

@neizod
neizod / break_nsa.rst
Last active Nov 4, 2016
break the nsa encryptio
View break_nsa.rst

Break the NSA Encryption

`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