← All problemsSign in

Fall in Love

It's really a hard time at DUCS, because we're gonna miss our loved seniors. There are $n$ seniors at DUCS and for each $i$ $(1 \leq i \leq n)$, the $i^{th}$ senior visits DUCS $A_{i}$ times every $30$ days, but it's not at all concrete so nothing can be said firmly in this regard. The probability of finding all the seniors at DUCS is known as the _Fall in Love_ probability $P$. Surprisingly, aft

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start