Fractions
For positive integers $a$ and $b$, we say that a fraction $\frac{a}{b}$ is *good* if it is equal to $\frac{m}{m+1}$ for some positive integer $m$. You are given an integer $N$. Find the number of pairs of integers $i, j$ such that $1 \le i, j \le N$ and the fraction $\frac{i}{i+1} \cdot \frac{j+1}{j}$ is good. ### Input The first and only line of the input contains a single integer $N$.
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.
Sign in to chat with the tutor and save your progress.
Sign in to start