benchmarks.wiki / Public workspace
Omni-MATH / Problem Steve is piling m≥1 indistinguishable stones on the squares of an n×n grid. Each square can have an arbitrarily high pile of stones. After he finished piling his stones in … · Discussion
Discussing Problem Steve is piling m≥1 indistinguishable stones on the squares of an n×n grid. Each square can have an arbitrarily high pile of stones. After he finished piling his stones in … · Omni-MATH
Posts
Chronological order within this page.
State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.