Skip to content

Instantly share code, notes, and snippets.

@ysmood
ysmood / shortest_mp3.js
Created April 21, 2015 10:49
shortest mp3
dataUri = 'data:audio/mpeg3;base64,SUQzAwAAAAAAFgAAAAAAAAAAAAAAAAAAAAAAAAAAAAD/4xjAAAAAAlwAAAAAtASxAAAAAAAARQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD/4xjAMQAAAlwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD/4xjAbAAAAlwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA='
@ysmood
ysmood / https_example.coffee
Last active August 29, 2015 14:16
https example
###
openssl genrsa -out key.pem
openssl req -new -key key.pem -out csr.pem
openssl x509 -req -days 9999 -in csr.pem -signkey key.pem -out cert.pem
rm csr.pem
###
{ kit } = require 'nobone'
nobone = require 'nobone'
{kit, renderer} = nobone { renderer: {} }
kit.watch_dir {
dir: '.'
pattern: ['*/', '*.styl']
handler: (type, path) ->
kit.log path
renderer.render(path, '.css', {}, false)
#!/usr/bin/env python
# Question:
# If user_1 followed user_2, we will get an array item like:
# [id_1, id_2]
# Here is a sample user relationship list:
# [ [2, 3], [1, 4], [3, 2], [1, 3], [4, 2], [7, 2], [5, 3], [4, 1] ]
# If two items have two same IDs, print one of the them out.
# So if we print out [3, 2] and [1, 4], that should be a right result.
#!/usr/bin/env ruby
# Question:
# If user_1 followed user_2, we will get an array item like:
# [id_1, id_2]
# Here is a sample user relationship list:
# [ [2, 3], [1, 4], [3, 2], [1, 3], [4, 2], [7, 2], [5, 3], [4, 1] ]
# If two items have two same IDs, print one of the items out.
# So if we print out [3, 2] and [1, 4], that should be a right result.
@ysmood
ysmood / break_deep_loop.js
Last active January 1, 2016 04:39
break_deep_loop
fun_closure = function(n) {
for (i = 0; i < n; i++)
(function(){
for (j = 0; j < n; j++)
for (k = 0; k < n; k++) {
if (j * k > n) return;
j + k;
}
})()
@ysmood
ysmood / shift.py
Last active December 29, 2015 17:59
def buildCoder(shift):
def gen(a, z): return zip(map(chr, range(a, z)), map(chr, range(a + shift, z - shift) + range(a + 25 - shift, z)))
return dict( gen(ord('a'), ord('z')) + gen(ord('A'), ord('Z')) )
print buildCoder(3)
@ysmood
ysmood / g.py
Created October 27, 2013 04:59
low = 0
high = 100
guess_number = (low + high) / 2
print("Please think of a number between 0 and 100!")
while True:
char = raw_input("Is your secret number " +
str(guess_number) + "?\n" +
"Enter 'h' to indicate the guess is too high." +
"Enter 'l' to indicate the guess is too low." +
@ysmood
ysmood / archlinux_installation_guide.md
Last active December 23, 2015 15:29
archlinux_installation_guide

Archlinux Installation Guide

  1. Select kernel version "Other Linux 3.x kernel".
  2. Set the vm's hardware resource limitation.
  3. Boot Arch.
  4. Partition.
  • Show disk list: fdisk -l
  • Create partition: cfdisk /dev/sda 0. /dev/sda1 for boot. Primary, Bootable
  1. /dev/sda2 for swap. Primary, Type 82
@ysmood
ysmood / tail_recursion.c
Last active December 22, 2015 23:19
gcc test: `gcc -O3 tail_recursion.c`
#include "stdio.h"
void foo(x) {
printf("%d\n", ++x);
foo(x);
}
int main(int argc, char const *argv[]) {
foo(1);
return 0;