bzoj 1833

f[pos][top]

统计数字个数

g[pos][top][digit]

统计数位（对于f[pos][top]中的所有数）

 /**************************************************************
     Problem: 1833
     User: idy002
     Language: C++
     Result: Accepted
     Time:0 ms
     Memory:808 kb
 ****************************************************************/

 #include <cstdio>
 #include <cstring>

 typedef long long poi;

 poi lf, rg;
 int aa[], tot;
 poi f[][], g[][][];
 poi ans[][];

 void calc( poi v, poi ans[] ) {
     for( tot=; v; v/= )
         aa[++tot] = v%;
     memset( f, , sizeof(f) );
     memset( g, , sizeof(g) );
     f[tot][] = ;
     f[tot][] = aa[tot]-;
     for( int i=tot; i>=; i-- ) {
         f[i-][] = ;
         f[i-][] = f[i][]*++f[i][]*aa[i-];
     }
     g[tot][][aa[tot]] = ;
     for( int i=; i<aa[tot]; i++ )
         g[tot][][i] = ;
     for( int i=tot; i>=; i-- ) {
 //      for( int s=0; s<=9; s++ )
 //          g[i-1][0][s] = g[i][0][s]*10+f[i][0]+(s!=0);
         for( int s=; s<=; s++ ) {
             g[i-][][s] += f[i][];
             for( int ss=; ss<=; ss++ ) {
                 g[i-][][ss] += g[i][][ss];
             }
         }
         for( int s=; s<=; s++ )
             g[i-][][s]++;
         for( int s=; s<aa[i-]; s++ ) {
             g[i-][][s] += f[i][];
             for( int ss=; ss<=; ss++ ) {
                 g[i-][][ss] += g[i][][ss];
             }
         }
         for( int s=; s<=; s++ )
             g[i-][][s] = g[i][][s]+(aa[i-]==s);
     }

     for( int i=; i<=; i++ )
         ans[i] = g[][][i]+g[][][i];
 }

 int main() {
     scanf( "%lld%lld", &lf, &rg );
     calc(rg,ans[]);
     if( lf> ) calc(lf-,ans[]);
     for( int i=; i<=; i++ )
         printf( "%lld%s", ans[][i]-ans[][i], i== ? "" : " " );
 }