[分析]:d[i]记录用i跟火柴可以组成多少种数字,更新式是d[i+c[j]] += d[i], c[j]就是组成数字j要用的火柴数。但是不能以0开头,最后当火柴数大于等于6的时候就可以在总答案上+1,表示可以构成一个单独的0(因为之前没有0开头的,所以要+1补回来),最后答案就是f[n] = d[1] + d[2] + d[3] + …. + d[n],数据很大,大数运算。
代码如下:
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int mod = 10;
const int maxn = 2e3+30;
const int maxm = 1000;
const int c[] = {6,2,5,5,4,5,6,3,7,6};
int d[maxn][maxm],a[maxn];
int f[maxn][maxm];
void init(){
int len;
memset(d,0,sizeof(d));
d[0][0] = 1;
for (int i=0; i<=maxn-30; i++) {
for (int j=0; j<10; j++) {
if (!(i+j==0) && i+c[j]<=maxn-30) {
for (int k=0; k<maxm; k++) d[i+c[j]][k] += d[i][k];
for (int k=0; k<maxm-1; k++) {
d[i+c[j]][k+1] += d[i+c[j]][k]/mod;
d[i+c[j]][k] %= mod;
}
}
}
}
memset(f,0,sizeof(f));
f[1][0] = d[1][0];
for (int i=2; i<=maxn-30; i++) {
for (int j=0; j<maxm; j++) f[i][j] = f[i-1][j] + d[i][j];
for (int j=0; j<maxm-1; j++) {
f[i][j+1] += f[i][j]/mod;
f[i][j] %= mod;
}
}
for (int i=6; i<=maxn-30; i++) {
f[i][0]++;
for (int j=0; j<maxm-1; j++) {
f[i][j+1] += f[i][j]/mod;
f[i][j] %= mod;
}
}
for (int i=2; i<=maxn-30; i++) {
len = maxm-1;
while (f[i][len]==0) len--;
a[i] = len;
}
}
int n;
int main(){
init();
while (scanf("%d",&n)!=EOF){
for (int i=a[n]; i>=0; i--) printf("%d",f[n][i]);
printf("\n");
}
return 0;
}