View bcvi.c
/* Badly Coded Text Editor BCVI, a product of Badly Coded, Inc. */
/* This is an example insecure program for CSci 5271 only: don't copy
code from here to any program that is supposed to work
correctly! */
/* version 1.0 was for exploits due 9/15/2017 */
/* This is version 1.1, for exploits due 9/22/2017. */
long bcvi_version = 110; /* 1.1 */
View problem4.c
/*
Here’s a function that’s intended to reverse the order of a subsequence of integers within an
array. For instance suppose the array a originally contains the integers 1 2 3 4 5 6 7 8 9. If
you call reverse_range(a, 2, 5), the afterwards the array a will contain the same integers but
with the ones in positions 2 through 5 (counting from zero) in the opposite order. I.e., a will be 1
2 6 5 4 3 7 8 9.
Unfortunately you’ll see that this function was not implemented very carefully.
*/
/*
View request_iter_lines_test.py
import unittest
import requests
from io import BytesIO
print(requests.__file__)
class TestIterLines(unittest.TestCase):
def iter_lines_response(self, chunk_size, delimiter=None):
response = requests.Response()
View err.txt
2.4.1 :009 > PackageManager::Rubygems.update "split"
ETHON: performed EASY effective_url=https://rubygems.org/api/v1/gems/split.json response_code=200 return_code=ok total_time=0.186102
HTTP Cache: [GET /api/v1/gems/split.json] miss, store
Saving split
Project Load (1.3ms) SELECT "projects".* FROM "projects" WHERE "projects"."name" = $1 AND "projects"."platform" = $2 LIMIT $3 [["name", "split"], ["platform", "Rubygems"], ["LIMIT", 1]]
(0.6ms) BEGIN
Project Exists (1.3ms) SELECT 1 AS one FROM "projects" WHERE "projects"."name" = $1 AND ("projects"."id" != $2) AND "projects"."platform" = $3 LIMIT $4 [["name", "split"], ["id", 2], ["platform", "Rubygems"], ["LIMIT", 1]]
Version Load (1.1ms) SELECT "versions".* FROM "versions" WHERE "versions"."project_id" = $1 [["project_id", 2]]
SQL (0.9ms) UPDATE "projects" SET "updated_at" = $1, "latest_release_published_at" = $2 WHERE "projects"."id" = $3 [["updated_at", "2017-08-25 15:47:13.860364"], ["latest_release_published_at", "2017-08-25 15:46:55
View err.txt
0.04s$ $HOME/gopath/bin/goveralls -coverprofile=coverage.out -service=travis-ci -repotoken $COVERALLS_TOKEN
flag needs an argument: -repotoken
Usage: /home/travis/gopath/bin/goveralls [options]
-covermode string
sent as covermode argument to go test (default "count")
-coverprofile string
If supplied, use a go cover profile (comma separated)
-debug
Enable debug output
-endpoint string
View parse.py
import sys
# Error-inducing lines didn't have anything interesting.
only_errs = False
def to_camel_case(snake_str):
components = snake_str.split('_')
return "".join(x.title() for x in components)
for line in sys.stdin:
View keybase.md

Keybase proof

I hereby claim:

  • I am e-beach on github.
  • I am beachicus (https://keybase.io/beachicus) on keybase.
  • I have a public key ASDSgfhNDUmyKoHsUCFoqYKLm66qDiJzY3yh95rhuSTa4go

To claim this, I am signing this object:

View screenshot.sh
# for convenience, get the most recent screen shot on osx
# might work for other OSs
screenshot=~/Desktop/$(ls -t ~/Desktop/ | grep "Screen Shot" | head -n 1)
# move it to currend working directory, and then do what you will.
mv "$screenshot" .
View heap.py
def swap(a, i, j):
a[i], a[j] = a[j], a[i]
def is_heap(a):
n = 0
m = 0
while True:
for i in [0, 1]:
m += 1
if m >= len(a):
View heap.py
def swap(a, i, j):
a[i], a[j] = a[j], a[i]
def heapify(a, n, max):
while True:
biggest = n
c1 = 2*n + 1
c2 = c1 + 1
for c in [c1, c2]:
if c < max and a[c] > a[biggest]: