HUST 1600 Lucky Numbers

暴力打表。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
using namespace std;

long long a[];
long long L, R;
int tot;

void dfs(long long num, int len)
{
    if (len > ) return;
    if (num>=&&num<=&&num %  == ) a[tot++] = num;
    dfs(num *  + , len + );
    dfs(num *  + , len + );
}

void init()
{
    tot = ;
    dfs(, );
    dfs(, );
}

int main()
{
    init();
    while (~scanf("%lld%lld", &L, &R))
    {
        long long ans = ;
        for (int i = ; i < tot; i++)
            if (a[i] >= L&&a[i] <= R) ans++;
        printf("%lld\n", ans);
    }
    return ;
}