We can solve a question like "counting the numbers between range which follow some properties" using Digit DP, like count the n digit number whose sum of digits is divisible by 3.
But how can we solve, "sum of the numbers between range which follow some properties" like "sum of n digit numbers whose digit sum is divisible by k". constraints: n = 1e5, 2 <= k <= 10
Please give me a link where I can read about how to solve these types of problems.
Range of $$$n$$$ and $$$k$$$?
lets say n = 1e5, k = 3
Look at this editorial and comment section also
Thanks, I have seen already it.
https://codeforces.com/blog/entry/67679 I practiced some of the digit dp problems mentioned in this blog, though I don't think I have seen a problem exactly like one you have mentioned but similar problems are present in this blog. I hope this helps.
Thanks, will try.
can anybody explain to me here?
This is really good video about digit dp https://www.youtube.com/watch?v=Pa4YwO8B8-w. And there are solutions to some problems.
http://letmegooglethat.com/?q=digit+dp
Can people not google smh. I understand asking for help about something specific, but when it's a general topic no reason to waste people's time rewriting what's already been written. Thousands of already good explanations are on the web. If you want personalized explanation that is what paying a coach is for...
I have already searched, I don't know how to solve the problem that I have given.
Auto comment: topic has been updated by starboy_jb (previous revision, new revision, compare).
Help Somebody.
You can read the editorial for this problem
Thanks.
Bruh how about you learn more about digit dp and understand it fully instead of asking for spoonfeeding.
Thanks.
Counting problems from A to B https://codeforces.com/blog/entry/8221