Count The Bits Gym - 101982D

https://cn.vjudge.net/problem/Gym-101982D 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-3
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int N=1e3+9;
const int M=4e5+9;
const ll mod= 1000000009;

int b,k;
ll dp[130][1009][130];
ll dfs(int pos,int yu,int limit,int num1)
{
    if(pos<0) return yu==0?num1%mod:0;
    if(!limit&&dp[pos][yu][num1]!=-1) return dp[pos][yu][num1]%mod;
    int sum=0;
    for(int i=0;i<=1;i++)
    {
        sum=(sum+dfs(pos-1,(yu*2+i)%k,limit&&i==1,(num1+i)%mod))%mod;
    }
    dp[pos][yu][num1]=sum;
    return sum;
}
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    cin>>k>>b;
    mem(dp,-1);
    ll ans=dfs(b-1,0,1,0);
    cout<<ans<<endl;

    return 0;
}

 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-3
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int N=1e3+9;
const int M=4e5+9;
const ll mod= 1000000009;

ll dp[130][1009],num[130][1009];
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int k,b;
    cin>>k>>b;
    ll a=1;
    num[0][0]=1;
    for(int i=1;i<=b;i++)
    {
        for(int j=0;j<k;j++)
        {
            num[i][j]=(num[i][j]+num[i-1][j])%mod;
            num[i][(j+a)%k]=(num[i][(j+a)%k]+num[i-1][j])%mod;
            dp[i][j]=(dp[i][j]+dp[i-1][j])%mod;
            dp[i][(j+a)%k]=(dp[i][(j+a)%k]+dp[i-1][j]+num[i-1][j])%mod;//有多少个i位为1就是多多少个1
        }
        a=(a*2)%k;
    }
    cout<<dp[b][0]<<endl;
    return 0;
}