Submission #1981693

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
//#include "util.h"

using namespace std;

//呪文
#define DUMPOUT cout
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr; } cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; }	cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) {	if (s.empty()) { cout << "{ }"; return ostr; } stack<_Ty> t(s); cout << "{" << t.top(); t.pop(); while (!t.empty()) { cout << ", " << t.top(); t.pop(); } cout << "}";	return ostr; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { cin >> m.first >> m.second; return istr; }
template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) cin >> v[i]; return istr; }
ll modpow(ll n, ll p, ll m) { ll result = 1; while (p > 0) { if (p & 1) result = (result * n) % m; p >>= 1; n = (n * n) % m; } return result; }
template <typename _Ty> _Ty ipow(_Ty x, _Ty n) { _Ty ret = _Ty(1); for (_Ty i = _Ty(0); i < n; i++) ret *= x; return ret; }
template<typename _Ty> void print(vector<_Ty>& v, char delim = ' ') { cout << v[0]; for (uint i = 1; i < v.size(); i++) cout << delim << v[i]; cout << endl; }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-8
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()
#define fake false

bool is_taboo(ll n) {
	while (n) {
		ll k = n % 10;
		if (k == 4 || k == 9) return true;
		n /= 10;
	}
	return false;
}

vector<ll> cnt;

ll taboo(ll N) {
	stack<pll> st;
	
	ll M = N, d = 0;
	while (M) {
		st.push(pll(d, M % 10));
		M /= 10; d++;
	}

	ll res = 0;
	while (!st.empty()) {
		pll p = st.top(); st.pop();
		d = p.first;
		ll x = p.second;
		
		for (ll i = 0; i < x; i++) {
			if (i == 4 || i == 9) res += ipow(10LL, d);
			else res += cnt[d];
		}
		if (x == 4 || x == 9) return res + N % ipow(10LL, d) + 1LL;
	}

	return res;
}


int main()
{
	//clock_t start, end;
	//start = clock();

	cnt = vector<ll>(20, 0);

	for (ll i = 0; i <= 18; i++)
		cnt[i] = ipow(10LL, i) - ipow(8LL, i);
		
	ll A, B;
	cin >> A >> B;

	cout << taboo(B) - taboo(A - 1) << endl;

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}

Submission Info

Judge Result