ZOJ-The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple-E
ACM模版描述题解典型的数位dp,没什么太多可说的,注意前缀0不需要剔除。代码#include#includeusingnamespacestd;typedeflonglongll;constintLEN=8;constintMAXN=LEN+5;constintEC[]={6,2,5,5,4,5,6,3,7,6,6,5,4,5,5,4};constllINF=0xFFFFFFFF;constll