题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2089
解题思路:
不信邪的暴力了下,TLE。打表预处理出每个数是否是吉利数。这里注意下我们在判断每个数时,数组保存的是原数的逆序,所以判断条件应该是当前数字是6,前一个数字是2,这样子原数中才是62,此处WA了N发·····
前几天比赛时听LHR说了下cin加速器,防超时百度了下·····新技能get······慎用memset初始化,对于10^6的数组,初始化即便用memset也挺慢的,别问我为什么,实践出真知。
完整代码:
#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <climits>
#include <cassert>
#include <complex>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long LL;
typedef double DB;
typedef unsigned uint;
typedef unsigned long long uLL;
/** Constant List .. **/ //{
const int MOD = int(1e9)+7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const DB EPS = 1e-9;
const DB OO = 1e20;
const DB PI = acos(-1.0); //M_PI;
const int maxn = 1000071;
int a[maxn];
bool vis[maxn];
bool check(int key)
{
int t = 0;
while(key != 0)
{
int k = key % 10;
if(k == 4)
return false;
a[t] = k;
if(a[t] == 6 && a[t-1] == 2 && t >= 1)
return false;
t++;
key /= 10;
}
return true;
}
void init()
{
for(int i = 1 ; i < maxn ; i ++)
{
if(check(i))
vis[i] = true;
else
vis[i] = false;
}
}
int solve(int n , int m)
{
int cnt = 0;
for(int i = n ; i <= m ; i ++)
{
if(vis[i])
cnt ++;
}
return cnt;
}
int main()
{
#ifdef DoubleQ
freopen("in.txt","r",stdin);
#endif
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n , m;
init();
while(cin >> n >> m)
{
if(n == 0 && m == 0)
break;
cout << solve(n , m) << endl;
}
}