I hereby claim:
- I am neilmayhew on github.
- I am neil_mayhew (https://keybase.io/neil_mayhew) on keybase.
- I have a public key ASAuEc7S-F-BkzOBsWRe9AsYaOUOMw9X81JWkCF4ZA3GTwo
To claim this, I am signing this object:
{-# LANGUAGE TupleSections #-} | |
import Control.Arrow (first, second) | |
import Control.Monad (forM_) | |
import Data.List (intersperse, intersect, (\\)) | |
import System.IO (hFlush, stdout) | |
-- Generate the list of possible choices of n items from a list | |
-- Each choice is a pair of the chosen and not-chosen items | |
choices 0 xs = [([], xs)] |
W W - - - | |
- - - B B | |
- - - - B | |
W - - - - | |
- - B B - | |
W - - W - | |
W - - - - | |
- - - - B | |
- B - - B |
// Use the digits 0-9 (once each) to create two numbers by concatenation. (e.g. 152 and 3476980). | |
// What's the highest product you can achieve when these two numbers are multiplied together? | |
using System; | |
using System.Linq; | |
using System.Numerics; | |
using System.Collections.Generic; | |
namespace HighProduct | |
{ |
let mergeSort xs = | |
let wrap x = [x] | |
let rec merge = function | |
| x::xs, y::ys -> if x < y then x :: merge (xs, y::ys) else y :: merge (x::xs, ys) | |
| l, [] -> l | |
| [], m -> m | |
let rec mergePairs = function | |
| (l::m::ns) -> merge (l, m) :: mergePairs ns | |
| ls -> ls | |
let rec mergeAll = function |
// Display trees of factors of integers | |
// Tree type | |
type 'a Tree = | |
| Branch of 'a * 'a Tree * 'a Tree | |
| Leaf of 'a | |
// Computation of Trees of factors |
#!/bin/sh | |
# This file is sourced by Xsession(5), not executed. | |
# Conditionally restrict the set of applications visible to the user | |
if [ -e ~/.config/restrict-applications.conf -a -n "$XDG_DATA_DIRS" ] | |
then | |
XDG_DATA_DIRS=$(restrict-applications) | |
fi |
*.log |
#include <cstring> // For strerror | |
#include <list> | |
#include <memory> | |
#include <vector> | |
#include <stdexcept> | |
#include <unistd.h> // For read | |
std::vector<unsigned char> readfile(int fd) | |
{ | |
struct Chunk |
./duplicity-inc.20170401T165721Z.to.20170402T145302Z.vol1.difftar.gpg | |
./duplicity-full.20170331T220513Z.vol1.difftar.gpg | |
./duplicity-full.20170331T220513Z.vol2.difftar.gpg | |
./duplicity-full.20170331T220513Z.vol3.difftar.gpg | |
./duplicity-full.20170331T220513Z.vol4.difftar.gpg | |
./duplicity-full.20170331T220513Z.vol5.difftar.gpg | |
./duplicity-full.20170331T220513Z.vol6.difftar.gpg | |
./duplicity-full.20170331T220513Z.vol7.difftar.gpg | |
./duplicity-full.20170331T220513Z.vol8.difftar.gpg | |
./duplicity-full.20170331T220513Z.vol9.difftar.gpg |
I hereby claim:
To claim this, I am signing this object: