Determine the number of ordered pairs of positive integers $(m,n)$ with $1 \leq m \leq 100$ and $1 \leq n \leq 100$ such that \[ \gcd(m+1,n+1) = 10\gcd(m,n). \]

Let's think step by step and output the final answer within \boxed{}.
user