Misha Kozik mishadoff

1. Writool - tool for writers

Online markdown text editor capable to generate PDF and HTML. Contains a set of useful options for writers:

	-- Tinkering with postgres arrays

	-- Part I: PREPARE

	-- create table
	create table movies (
	title text,
	tags text[],
	year int
	);

	create table test (
	key text,
	value text
	);

	insert into test (key, value) values ('1', 'Pulp Fiction');
	insert into test (key, value) values ('2', 'Reservoir Dogs');
	insert into test (key, value) values ('3', 'Inglorius Bastards');
	insert into test (key, value) values ('4', 'Django');
	insert into test (key, value) values ('5', 'Kill Bill');

	#include <stdio.h>
	#include <string.h>

	int main(int argc, char *argv[]) {
	if (argc != 2) {
	fprintf(stderr, "[ERROR] Provide a path!\n");
	return 1;
	}

	char* path = argv[1];

	public class com.mishadoff.RomanTheStack {
	public com.mishadoff.RomanTheStack();
	Code:
	0: aload_0
	1: invokespecial #1 // Method java/lang/Object."<init>":()V
	4: return

	public static void main(java.lang.String[]);
	Code:
	0: ldc #2 // float 14.88f

	#!/bin/bash
	#
	# Find the time difference between two commits
	# Usage: ./git_time_diff.sh 863a810d 7407b97c

	commit1=$1
	commit2=$2

	ts1=$(git show -s --format=%ct $commit1)
	ts2=$(git show -s --format=%ct $commit2)

	# Using STM

	Create a custom implementation of some data structure. Data structure
	should work according to its definition,
	follow the Big-O limitations,
	be completely thread-safe in concurrent environment and use only STM
	primitives in implementation.

	You are free to use any Java STM library, but we recommend
	[Multiverse STM](http://multiverse.codehaus.org/overview.html)

	(:require [jopbox.client :as dbx])

	(def APP-KEY "YOUR_APP_KEY")
	(def APP-SECRET "YOUR_APP_SECRET")

	;; make consumer and request token
	(def consumer (dbx/make-consumer APP-KEY APP-SECRET))
	(def request-token (dbx/fetch-request-token consumer nil))

	;; generate authorization url

	(defn solve [r t]
	"r - initial radius, t - mls of paint"
	(letfn [(nrings [n]
	(+' (*' 2 n n)
	(-' n)
	(*' 2 r n)))
	(binary [[a b]]
	(cond (or (= a b) (= (inc a) b)) a
	:else (let [avg (quot (+' a b) 2)
	pnt (nrings avg)]