foota

#include <iostream>
#include <string>
#include <bitset>
#include <ctime>

using namespace std;

// dynamic programming
const int SIZE = 100;

foota

#!/usr/bin/env python
"""
Auto Cookie Clicker by foota, 2013.09.21
ref. http://orteil.dashnet.org/cookieclicker/
"""

import sys, os, time, threading
from pymouse import PyMouse
import ImageGrab

foota

import android
from wsgiref.simple_server import make_server

droid=android.Android()
pic='/sdcard/snapshot.jpg'

def camera(env,res):
  if env['PATH_INFO']=='/':
    droid.cameraCapturePicture(pic)
    res('200 OK',[('Content-type','image/jpeg')])

foota

#!/usr/bin/env python

import sys, os
from pylab import *

gcd = lambda x, y: y and gcd(y, x % y) or x
fx = lambda t, rc, rm, rd: (rc - rm) * cos(t * pi) + rd * cos(t * pi * (rc - rm) / rm)
fy = lambda t, rc, rm, rd: (rc - rm) * sin(t * pi) - rd * sin(t * pi * (rc - rm) / rm)
p = lambda x, rc, rm, rd: plot(fx(x, rc, rm, rd), fy(x, rc, rm, rd))

foota

#!/usr/bin/env python

import sys
import os
import math
import time
from PIL import Image

def tetration(l, t, w, h, sw, sh, mit):
    data = []

foota

#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys
import time
import json
import time
import threading
import datetime
import Queue

foota

#!/usr/bin/env python
# -*- coding: utf-8 -*-

def tarai(x, y, z):
    return tarai(tarai(x - 1, y, z),
                 tarai(y - 1, z, x),
                 tarai(z - 1, x, y)) if x > y else y

def factorial(n):
    return n == 0 and 1 or reduce(lambda x, y: x * y, range(1, n + 1))

foota

// Count paths from (0, 0) to (N, N) in the NxN lattice graph using DFS.

#include <iostream>
#include <sstream>
#include <vector>

using namespace std;

static unsigned long long cnt = 0;

foota

#!/usr/bin/env python
"""
Count all paths from upper left to lower right on NxN lattice graph.

Build (required SGB and GMP libraries):
% gcc gen_lattice.c -O3 -lgb -o gen_lattice
% wget http://www-cs-faculty.stanford.edu/~uno/programs/simpath.w
% ctangle simpath.w
% gcc simpath.c -O3 -lgb -o simpath
% wget http://www-cs-faculty.stanford.edu/~uno/programs/simpath-reduce.w

foota

// Count paths on a lattice graph.

#include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
#include <algorithm>

#include <gmp.h>