Beautiful Sequence

CodeChefOpen on judge ↗

250 POINTS A sequence of l integers b1, b2, ..., bl (1 ≤ b1 ≤ b2 ≤ ... ≤ bl ≤ n) is called good if each number divides (without a remainder) the next number in the sequence. More formally for all i (1 ≤ i ≤ l - 1). Given n and k find the number of good sequences of length k. As the answer can be rather large print it modulo 1000000007 (10^9 + 7). Input The first line of input contains two sp

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