Code:
#include
#define N 50001
#define ll long long
#define lson now<>1;
if(r>mid) t[now]=t[now]*t[rson];
}
void build(int l,int r,int now)
{
if(l==r)
{
t[now][0][0]=t[no
Tag: DP
ACWING – 338 – Counting Issues = Digital DP
https://www.acwing.com/problem/content/description/340/
It’s the first time to do this kind of numbering, and it feels like it is the same in theory , The return is not 1 but his contribution
B-NUMBER digital DP
ask for the number that has 13 and is divisible by 13
Obviously, the current four states cannot fully answer the question. Regarding whether it can be 13 Divide it is necessary to add a mod s