Zachary Becker zrbecker

I hereby claim:

To claim this, I am signing this object:

	'''Utilities for managing time at different resolutons'''

	from collections import defaultdict, deque, namedtuple
	from datetime import datetime, timedelta

	import logging
	logging.basicConfig(level=logging.DEBUG)
	logging.disable(logging.CRITICAL) # Comment out for debug messages

	class SquareRootException(Exception):
	pass

	def square_root(n):
	if n < 0:
	raise SquareRootException(
	f'{n} is negative, so it does not have a square root.')
	if n == 0 or n == 1:
	return n
	start = 0

	<!doctype html>
	<html>
	<head>
	<meta charset="utf-8">
	<meta key="viewport" value="width=device-width,initial-scale=1">
	<title>Vue.js Test</title>
	<link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/4.0.0-alpha.6/css/bootstrap.min.css" integrity="sha384-rwoIResjU2yc3z8GV/NPeZWAv56rSmLldC3R/AZzGRnGxQQKnKkoFVhFQhNUwEyJ" crossorigin="anonymous">
	</head>
	<body>
	<div class="container">

	#include "Combinations.h"

	namespace ZB
	{
	Combinations::Combinations(int n, int k)
	: m_n(n)
	, m_k(k)
	{

	}

	# given a knapsack of size n, a list of items costs C and weights W
	# this function returns a list of items which fits in the knapsack of
	# maximum cost
	#
	# algorithm runs in O(nm) where m = len(C) = len(W)
	def knapsack(n, C, W):
	# m is number of items in list
	m = len(C)

	# create two dimensional array

	char file2string(const char path)
	{
	FILE *fd;
	long len,
	r;
	char *str;

	if (!(fd = fopen(path, "r")))
	{
	fprintf(stderr, "Can't open file '%s' for reading\n", path);