这种题一般是找规律。写几个小数然后就可以发现规律了。很容易发现1,2,5以及他们的10^n倍一定是符合条件的,另外,相对稍微隐蔽的是25,125以及他们的10^n倍。
/*
* Author: stormdpzh
* Created Time: 2012/7/29 16:25:43
* File Name: a.cpp
*/
#include <iostream>
#include <cstdio>
#include <sstream>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <functional>
#define sz(v) ((int)(v).size())
#define rep(i, n) for(int i = 0; i < n; i++)
#define repf(i, a, b) for(int i = a; i <= b; i++)
#define repd(i, a, b) for(int i = a; i >= b; i--)
#define out(n) printf("%d\n", n)
#define mset(a, b) memset(a, b, sizeof(a))
#define wh(n) while(1 == scanf("%d", &n))
#define whz(n) while(1 == scanf("%d", &n) && n != 0)
#define lint long long
using namespace std;
const int MaxN = 1 << 30;
vector<lint> res;
int main()
{
int a, b;
for(lint i = 1; i <= 1000000000; i *= 10) {
res.push_back(1 * i);
res.push_back(2 * i);
res.push_back(5 * i);
}
for(lint i = 1; i <= 100000000; i *= 10) {
res.push_back(25 * i);
res.push_back(125 * i);
}
while(2 == scanf("%d%d", &a, &b)) {
int ans = 0;
for(int i = 0; i < sz(res); i++) {
if(res[i] >= min(a, b) && res[i] <= max(a, b))
ans++;
}
printf("%d\n", ans);
}
return 0;
}