Drew Taylor drewstaylor

I hereby claim:

To claim this, I am signing this object:

	/**
	* Leonard is having trouble with his program, but the flame is its own reflection. Perhaps his coding skills are just rusty.
	* Do you have the patience and memory capacity to compute this simplest of equations? Shouldn't human brain power be enough?
	*/
	fn make(n: u32) -> u32 {
	match n {
	0 => 1,
	1 => 1,
	_ => make(n-1) + make(n-2),
	}

	% 4-Dimensional Object: The Tesseract
	% Matlab script
	%
	% Copyright 2009 Ian E., Adam H., Mark Ross <[email protected]>
	%
	% This program is free software: you can redistribute it and/or modify
	% it under the terms of the GNU General Public License as published by
	% the Free Software Foundation, either version 3 of the License, or
	% (at your option) any later version.
	%

	'''
	Example 2 looks at ascensions, which are special end of season puzzles. They require you submit all previous proofs of the season, in consecutive order, as well as the passwords of the current puzzle. Hashing rounds are increased for all puzzles with rewards. If a puzzle has rewards but isn't the final puzzle of that season, you won't need to submit all of the sub proofs in addition to the current passwords, but you will need to increase the rounds of hashing. You can access this ascension example at https://uanon.observer/learn, but only if you're holding the correct sub-proofs.

	Title: Through darkness and the ages, softly
	Description: We ascend
	Public Key: afbda72bc5ca82bc61d800fcc8fdfa4f059d95e58879795863b34525ded88fce
	Operation: oorfEK3FTyx3ha5FPY8vmpEQ86z1xQemVMXGd5BkNbqRPJTXHpq
	Format: Separate the sentences and add spaces between words. Cipher provides the case. No punctuation.
	Hint: Solution 4 is a single character, if you're confused get your faqs straight
	'''

	// Permutation generator in Golang (array of strings)
	package main

	import (
	"fmt"
	"strings"
	)

	func nextPerm(p []int) {
	for i := len(p) - 1; i >= 0; i-- {