HDOJ 2089

#include <iostream>#include <cstdio>#include <cstring>using namespace std;int num[1000005];char s[20];int main(){    int n, m, i, sum, t;    memset(num, 0, sizeof(num));    for( i=0; i<=1000005; i++ ){            memset(s, NULL, sizeof(s));            sprintf(s, "%d", i);            if( !strstr(s, "62") && !strstr(s, "4") )                num[i] = 1;    }    while( ~scanf("%d%d", &n, &m) )    {        if( !n && !m )            break;        sum = 0;        for( i=n; i<=m; i++ ){            if( num[i] )                sum++;        }        printf("%d\n", sum);    }    return 0;}

数位DP方法稍后补上...我发现- -我数位DP是我硬伤呀!