servers-of-happiness is too conservative when K = 1

[davidsarah]

When K = 1, any single share is sufficient to reconstruct the file. However, the servers-of-happiness code will still require that there are H servers with unique share numbers. It should not care about the share numbers.

(We knew of examples with small K where the maximum matching definition of servers-of-happiness was conservative relative to the original definition, e.g. 778#comment:198. However, for K > 1 it is more space-efficient to use the maximum matching definition. For K = 1 it is not.)