【数位DP】 HDOJ 5106 Bits Problem

用结构体记录两个变量代表当前的答案和方案数。。。。然后数位DP即可。。。

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 1005
#define maxm 200005
#define eps 1e-10
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
//#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

struct node
{
	LL sum, ans;
	node(int sum = 0, int ans = 0) : sum(sum), ans(ans) {}
}dp[1005][1005];
char str[1005];
LL two[1005];
int s[1005];
int n;

void init(void)
{
	two[0] = two[1] = 1;
	for(int i = 2; i <= 1000; i++) two[i] = (two[i-1] * 2) % mod;
	memset(dp, -1, sizeof dp);
}

node dfs(int pos, int sum, int limit)
{
	if(!pos) {
		if(!sum && !limit) return node(1, 0);
		else return node(0, 0);
	}
	if(dp[pos][sum].sum != -1 && !limit) return dp[pos][sum];
	int b = (limit ? s[pos] : 1);
	node t(0, 0);
	for(int i = 0; i <= b; i++) {
		node tt = dfs(pos - 1, sum - i, limit && i == b);
		t.sum = (t.sum + tt.sum) % mod;
		t.ans = (t.ans + tt.ans) % mod;
		t.ans = (t.ans + i * tt.sum * two[pos] % mod) % mod;
	}
	if(!limit) dp[pos][sum] = t;
	return t;
}

void work(void)
{
	int len = strlen(str + 1);
	for(int i = 1; i <= len; i++) s[i] = str[len - i + 1] - '0';
	printf("%I64d\n", dfs(len, n, 1).ans);
}

int main(void)
{
	init();
	while(scanf("%d%s", &n, str + 1)!=EOF) {
		work();
	}

	return 0;
}