P1066 2^k进制数

最新推荐文章于 2020-04-18 18:59:37 发布

wamach

最新推荐文章于 2020-04-18 18:59:37 发布

阅读量196

点赞数

分类专栏： luogu

本文链接：https://blog.csdn.net/wamach/article/details/72123945

版权

luogu 专栏收录该内容

26 篇文章 0 订阅

订阅专栏

代码讲得十分清楚。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
#define rep(i,j,k) for(i=j;i<=k;++i)
#define per(i,j,k) for(i=j;i>=k;--i)
#define ll long long
#define db double
#define mkp(x,y) make_pair(x,y)
#define pii pair<int,int>
#define X first
#define Y second
const int N=50005;
struct NUM{char num[201];int ln;}f[512][512],ans; 
int n,m,w,k,inf;
NUM add(NUM a,NUM b){
	NUM c;
	memset(c.num,0,sizeof c.num);
	c.ln=max(a.ln,b.ln);
	int i;
	rep(i,1,c.ln){
		c.num[i]+=a.num[i]+b.num[i];
		if(c.num[i]>9)
			c.num[i]-=10,++c.num[i+1];
	}
	if(c.num[c.ln+1])++c.ln;
	return c;
}
void write(NUM a){
	int i;
	per(i,a.ln,1)printf("%d",a.num[i]);
	puts("");
}
int main(){
	int i,j;
	scanf("%d%d",&k,&w);inf=(1<<k)-1;
	w=min(w,k*inf+1);
	n=(w-1)/k+1,m=(1<<(w-1)%k+1)-1;
	per(j,inf,0)f[1][j].num[f[1][j].ln=1]=1;
	rep(i,2,n)per(j,inf-i+1,0)
		f[i][j]=add(f[i-1][j+1],f[i][j+1]);
	rep(j,1,m)ans=add(ans,f[n][j]);
	rep(i,3,n)ans=add(ans,f[i][0]);
	write(ans);
	return 0;
}