First iteration of 5.5

Should print numbers under 1000 that are x%5==0
Getting closer..

Prints all numbers under 1000 that are divisible by 5, except numbers in
the form x0y.
Correctly prints out all numbers x%5==0
Now prints all x%3==0 || x%5==0 numbers under 1000
Starting to work on sum memory fixer
Sum fix sleed seems to be working at first

...but it has some bug that makes it fail after first iteration
Added comments to the sled for my own sanity
It.. works. I can't believe it, but I did it.

This brainfuck code actually calculates the sum of all numbers under
1000 that are divisible by 3 or 5.
Merge pull request #1 from koddsson/absalon-5-5

Absalon 5 5