You are given N. Find number of pairs of integers x, y such that
1 <= x < y <= N and sumOfDigits(x) > sumOfDigits(y)
N <= 10^100 and is given as a string.
Output answer modulo 1e9+7
I don't remember the sign of inequality properly, it might be sumOfDigits(x) < sumOfDigits(y). I read about digit DP to solve this but I cannot find any approach.
How to solve this?