Description
给出n和k,求出n位的k进制数中不包含两个连续的0的数,且没有前导 0的数有几个。如要求7位的十进制数,如1010230算一个,1000198和0011234 不算,
Solution
普通DP:
fi,0=fi−1,1
fi,1=m∗(fi−1,0+fi−1,1)
转化一下:
fi=m∗(fi−1+fi−2)
套上高精度即可。
Code
#include<iostream>
#include<cstdio>
#include<cstdlib>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define f1 f[W]
#define f2 f[E]
#define s1 f[Q]
using namespace std;
const int N=2000;
int n,m,ans;
int f[N][N],s[N];
void jia(int Q,int W,int E)
{
fill(s+1,s+1+s[0],0);
s[0]=max(f1[0],f2[0]);
fo(i,1,s[0])
{
s[i]+=f1[i]+f2[i];
s[i+1]+=s[i]/10;
s[i]%=10;
}
while(s[s[0]+1])s[0]++;
}
void chen(int Q,int w)
{
s1[0]=s[0];
fo(i,1,s1[0])
{
s1[i]+=s[i]*w;
s1[i+1]+=s1[i]/10;
s1[i]%=10;
}
while(s1[s1[0]+1])
{
s1[0]++;
s1[s1[0]+1]=s1[s1[0]]/10;
s1[s1[0]]%=10;
}
}
int main()
{
scanf("%d%d",&n,&m);m--;
f[0][0]=f[0][1]=f[1][0]=1;f[1][1]=m;
fo(i,2,n)
{
jia(i,i-1,i-2);
chen(i,m);
}
fod(i,f[n][0],1)printf("%d",f[n][i]);
printf("\n");
return 0;
}