I'm looking for an algorithm to "pack" a collection of sets as slices of a sequence. I'm sure somebody must have thought about this before. Specifically the algorithm has
Input: F_1, .., F_n where the F_i are finite subsets of some S
Output: A (shortest) sequence s_1, .., s_m in S such that for all i there is a j where F_i = { s_k | j <= k < j + |F_i| }
I hereby claim:
To claim this, I am signing this object:
| #!/bin/bash | |
| # | |
| # Esmil's magic rules file | |
| # - building Debian packages without insulting your intelligence since 2010 | |
| # | |
| # See debian/build.sh for package specific build instructions. | |
| # Here is a template for creating a new one: | |
| # | |
| # clean() { | |
| # make clean |
| export GIT_PS1_SHOWDIRTYSTATE=1 | |
| export GIT_PS1_SHOWSTASHSTATE=1 | |
| export GIT_PS1_SHOWUNTRACKEDFILES=1 | |
| export GIT_PS1_SHOWUPSTREAM='verbose' | |
| export GIT_PS1_SHOWCOLORHINTS=1 | |
| source /usr/share/git/git-prompt.sh | |
| function prompt_command() { | |
| [ -n "$DISPLAY" ] && echo -ne "\033]0;${PWD/$HOME/~}/ [$USER@$HOSTNAME]\a" | |
| __git_ps1 '' '\[\033[01;32m\]\u\[\033[00m\]@\[\033[00;32m\]\h\[\033[01;34m\]\w\[\033[00m\]\$ ' '%s\\n' |
| #include <stdlib.h> | |
| #include <string.h> | |
| #include <gio/gio.h> | |
| static GMainLoop *mainloop; | |
| static GDBusConnection *bus; | |
| static int exitcode = EXIT_FAILURE; | |
| #define AGENT_PATH "/agent" | |
| #define STACK_SIZE 20 |
| #include <stdlib.h> | |
| #include <stdint.h> | |
| #include <stdio.h> | |
| /* | |
| * returns a^e % n | |
| */ | |
| static unsigned int | |
| powm(unsigned int a, unsigned int e, unsigned int n) | |
| { |
| local template = require 'template' | |
| local html = template.new(function() | |
| html{ xmlns = 'http://www.w3.org/1999/xhtml', lang = 'en', ['xml:lang'] = 'en', | |
| head{ | |
| title 'Hathaway HTTP dump', | |
| style{ type='text/css', | |
| 'th { text-align:left; }' | |
| }, | |
| }, | |
| body{ |