HUST 1600 由4，8组成的数且能整除48 （dfs枚举）

Isun loves digit 4 and 8 very much. He thinks a number is lucky only if the number satisfy the following conditions: 
1.       The number only consists of digit 4 and 8. 
2.       The number multiples 48. 
One day, the math teacher gives  Isun a problem: 
         Given L and R(1 <= L <= R <= 10^15), how many lucky numbers are there between L and R. (i.e. how many x satisfy L <= x <= R, x is a lucky number). 

Input

Multiple test cases. For each test case, there is only one line consist two numbers L and R. 

Output

For each test case, print the number of lucky numbers in one line. 
  
Do use the %  lld specifier or  cin/  cout stream to read or write 64-bit integers in С++. 

Sample Input

1 48
1 484848

Sample Output

1
7

题意RT；

以后枚举数，可以用dfs来做！！！！！！！ 这种题老是想不到啊。。。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<stack>
#include<map>
using namespace std;
typedef long long ll;
stack<ll>ss;
map<int,ll>f;
void dfs(ll num)
{
	if(num>1000000000000000) return ;
	if(num%48==0) ss.push(num);
	dfs(num*10+4);
	dfs(num*10+8);
}
int main()
{
	int i,j,n,ans;
	ll r,l;
	dfs(0);
	n=0;
	while(!ss.empty()) {
		f[n++]=ss.top();
		ss.pop();
	}
	while(cin>>l>>r) {
		ans=0;
		for(i=0;i<n;i++) {
			if(f[i]>=l && f[i]<=r) ans++;
		}
		cout<<ans<<endl;
	}
	return 0;
}