Byte Heist Home Leaderboard
Join the Heist (with Github)
Solve View

Set Equality Counts

A challenge by mousetail avatar mousetail

Description

It is impossible for sets of certain sizes to have certain total numbers of equalities. For example, a set of 3 items can not have 2 equalities or by the transitive property the third pair must also be equal.

For each number between 1 and 30, print each possible number of equalites separated by spaces, in ascending order and including 0. Each set of numbers should be on it’s own line.

Leaderboard

Author Score
#1 mousetail avatar mousetail 86
#2 xnor-gate avatar xnor-gate 89
#2 EroticShiveringKingBanana avatar EroticShiveringKingBanana 89
#4 AlephSquirrel avatar AlephSquirrel 98
#5 MeWhenI avatar MeWhenI 103
#6 b-kamphorst avatar b-kamphorst 111
#7 Natanaelel avatar Natanaelel 201
Challenge ends in 2025-10-04
JavaScript (Deno) JavaScript (NodeJS) Python Rust C (tcc) APL (TinyAPL) Vyxal Vyxal 3
You must be logged in to submit a solution.