Bouke van der Bijl bouk

## gist:4178441
77a78,79
> coke
> cokes
84a87
> collier
89a93
> colt
157a162
> cote
186a192

## gist:4178408
9,12d8
< celt
< celts
< ceres
< cerf
15,17d10
< cf
< ci
< cipro
23d15

## gist:4178208
#include <string>
#include <algorithm>
#include <list>
#include <cstring>
#include <fstream>
#include <iostream>
#include <cctype>
#include <vector>
#include <set>

## gist:4127239
#!/bin/bash
if [ $# -lt 1 ]
then
    echo "Needs program filename argument"
    exit 1
fi

executable=`mktemp`
echo "Testing $1"
echo

## gist:3939575
# encoding: UTF-8

module BoukeTodoApp
  class TodoList
    def initialize(filename)
      @items = []
      @filename = filename

      self.load
    end

## gist:3939072
# encoding: UTF-8
TodoItem = Struct.new(:done, :contents)
todos = []
if File.exists? 'list.td'
  File.open('list.td') do |f|
    todos = f.read.split("\n")
    todos.map! { |item|
      new_item = TodoItem.new
      new_item.done, new_item.contents = item.split("|")
      new_item

## Battleships.py
'''
The algorithm works as follows:
It simply checks all positions, with positions being marked with None (unknown) x (part of a ship) or o (no ship)

Because the description says that ships can't touch (including diagonally) you know for sure that if a position
has the part of a ship that the positions diagonal to it don't, like so:
o.o
.x.
o.o

## index.html
<!doctype html>
<html>
  <head>
    <meta name="viewport" content="initial-scale=1.0, user-scalable=no" />
    <style type="text/css">
      html {
      height:100%
      }
      body {
      height:100%;

## index.html
<!DOCTYPE html>
<html>
<head>
<style>
* {
padding:0;
margin:0;
}
#canvas {
width:400px;

## gist:524611
$(document).ready(function()
    {

    }
);
	77a78,79
	> coke
	> cokes
	84a87
	> collier
	89a93
	> colt
	157a162
	> cote
	186a192
	9,12d8
	< celt
	< celts
	< ceres
	< cerf
	15,17d10
	< cf
	< ci
	< cipro
	23d15
	#include <string>
	#include <algorithm>
	#include <list>
	#include <cstring>
	#include <fstream>
	#include <iostream>
	#include <cctype>
	#include <vector>
	#include <set>
	#!/bin/bash
	if [ $# -lt 1 ]
	then
	echo "Needs program filename argument"
	exit 1
	fi

	executable=`mktemp`
	echo "Testing $1"
	echo
	# encoding: UTF-8

	module BoukeTodoApp
	class TodoList
	def initialize(filename)
	@items = []
	@filename = filename

	self.load
	end
	# encoding: UTF-8
	TodoItem = Struct.new(:done, :contents)
	todos = []
	if File.exists? 'list.td'
	File.open('list.td') do \|f\|
	todos = f.read.split("\n")
	todos.map! { \|item\|
	new_item = TodoItem.new
	new_item.done, new_item.contents = item.split("\|")
	new_item
	'''
	The algorithm works as follows:
	It simply checks all positions, with positions being marked with None (unknown) x (part of a ship) or o (no ship)

	Because the description says that ships can't touch (including diagonally) you know for sure that if a position
	has the part of a ship that the positions diagonal to it don't, like so:
	o.o
	.x.
	o.o
	<!doctype html>
	<html>
	<head>
	<meta name="viewport" content="initial-scale=1.0, user-scalable=no" />
	<style type="text/css">
	html {
	height:100%
	}
	body {
	height:100%;