hdu 4722 Good Numbers 数位dp(2013 ACM/ICPC Asia Regional Online —— Warmup2 1007)
#include#include#include#include#includeusingnamespacestd;#defineLL__int64LLc[20][11];LLfind(inta[],intn)//求0~a的符合条件的数{inti,j,k;memset(c,0,sizeof(c));intx=0;for(i=1;i<=n;i++)//从最高位开始,按位dp{for(j=0;j<10