Alexander Wei aw31

## L2.py
import numpy
from sklearn import svm

LENGTH = 6
ROWS = 70
COLS = 100

def get_answers(s):
    with open(s) as f:
        return f.read().split()

## H.cpp
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll INF = 1LL << 60;

struct node {
  node *p, *c[2];
  ll f, w, s, v, t, k, a, b;
  node(){}

## Codes for Recursion and Depth-First Search.md

      
              12 files
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                aw31
                / Codes for Recursion and Depth-First Search.md
            
            
              Last active
              August 29, 2015 14:08
            
              
                Codes for Recursion and Depth-First Search
              
          
    Recursion and Depth-First Search

These are the sample codes for each of the problems in the Recursion and Depth-First Search handout. (Available here.)
TODO:
Mother's Milk (Java)

  
## beamer.cpp
#include <iostream>
#include <cstdlib>
#include <fstream>
#include <vector>
using namespace std;

const string start =
	"\\documentclass{beamer}\n"
	"\\usetheme{default}\n"
	"\\begin{document}\n";
	import numpy
	from sklearn import svm

	LENGTH = 6
	ROWS = 70
	COLS = 100

	def get_answers(s):
	with open(s) as f:
	return f.read().split()
	#include <bits/stdc++.h>
	using namespace std;

	typedef long long ll;
	const ll INF = 1LL << 60;

	struct node {
	node p, c[2];
	ll f, w, s, v, t, k, a, b;
	node(){}
	#include <iostream>
	#include <cstdlib>
	#include <fstream>
	#include <vector>
	using namespace std;

	const string start =
	"\\documentclass{beamer}\n"
	"\\usetheme{default}\n"
	"\\begin{document}\n";