olymmath

BALKAN-SL 2016 C2

  • Answer

There are 2016 costumers who entered a shop on a particular day. Every customer entered the shop exactly once. (i.e. the customer entered the shop, stayed there for some time and then left the shop without returning back.) Find the maximal kk such that the following holds: There are kk customers such that either all of them were in the shop at a specific time instance or no two of them were both in the shop at any time instance.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

45

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator balkan-sl/2016/c2 · Tag FZK0NZCAEM · Edit this page on GitHub · Keys: j next, k previous