russoz

"""
Knapsacks have weight capacity; items have weight and value.

We want to find the allocation of items which maximizes the total
carried value.
"""

from typing import List, Set, Tuple

russoz

Keybase proof

I hereby claim:

• I am russoz on github.
• I am russoz (https://keybase.io/russoz) on keybase.
• I have a public key ASC1NFpYdSC7uOY5_hWxPCjYkgXcwFdqzSheOSnbCzV6sQo

To claim this, I am signing this object:

russoz

<?xml version="1.0" encoding="UTF-8"?>
<gconfentryfile>
  <entrylist base="/apps/nautilus-actions/configurations/c9089261-0d1b-4c28-b55b-72faa365307a">
    <entry>
      <key>type</key>
      <value>
        <string>Action</string>
      </value>
    </entry>
    <entry>

russoz

#!/usr/bin/perl
use warnings;
use strict;
use feature 'switch';

use Benchmark qw/cmpthese/;

sub work {
    my $p = shift;
    my $r = 0.0;

russoz

#!/usr/bin/perl
#
#  azpltw
#

use utf8;
use strict;
use warnings;

use Encode qw(encode decode);