matt-y

    def new_edge_point(self):
        side = random.randint(1,4)
        if side == 1: 
            #left side 
            return Vector(0, random.randint(0, constants.window_height))
        elif side == 2:
            #right side 
            return Vector(constants.window_width, random.randint(0, constants.window_height))
        elif side == 3:
            #top

matt-y

import sys

mapping = {
    'a':'y',
    'b':'h',
    'c':'e',
    'd':'s',
    'e':'o',
    'f':'c',
    'g':'v',

matt-y

class SpellCheck(object):
    def __init__(self):
        self.trigram_store = {}

    def compute_ngrams(self,word, n=3):
        '''
        Given a word of length N, this fucntion will compute N-(n-1)  n-grams 

        A trigram(n=3) is three letters ex: given 'that', we have 4-2=2 trigrams:
            'tha' and 'hat'

matt-y

import java.util.LinkedList;

/**
 * User: mattosaurus
 * Date: 1/30/12
 * Time: 8:10 PM
 */
public class Queens {
    private int n;
    private LinkedList<Integer> state;

matt-y

import java.util.LinkedList;

/**
 * User: mattosaurus
 * Date: 1/30/12
 * Time: 8:10 PM
 */
public class Queens {
    private int n;
    private LinkedList<Integer> state;

matt-y

;;this recursive one works 
(define (prod term a next b)
  (if (> a b)
      1
      (* (term a)
	 (prod term (next a) next b))))

;;this iterative one does not
;;Ex1.31
;;iterative product procedure 

matt-y

(define (list?? maybe-list)
  (cond ((null? maybe-list) #t)
	((and (pair? maybe-list)
	      (list?? (cdr maybe-list))) #t)
	(else #f)))

;;recursive 
(define (list-len list)
  (if (null? list) 
      0

matt-y

public class Problem {
    public static void main(String[] args) throws Exception {
        Scanner in = new Scanner(new File("voting.in"));
        String s = in.nextLine();
        while (!s.equals("#")) {
             //etc
        }
     }
}