Why Try

CodeChefRating 2890Open on judge ↗

*I've been livin' with devils and angels \ Angels, angels \ Realize you and I are in the same boat \ Same boat, yeah* Given an integer $N$, for each $1\le i \le N$, find the value of: $$ \large{\sum_{j = 1}^{N} {j - 1 \choose j - \left\lfloor \frac{j - 1}{i} \right\rfloor - 1}} $$ Since the answer can be very large, print it modulo $10^9 + 7$. Note that ${X \choose Y}$ refers to [$X$ choose $Y

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