Submission #1071471

---

Source Code Expand

#include "bits/stdc++.h"

#define REP(i,n) for(int i=0;i<n;++i)
#define RREP(i,n) for(int i=n-1;i>=0;--i)
#define FOR(i,m,n) for(int i=m;i<n;++i)
#define RFOR(i,m,n) for(int i=n-1;i>=m;--i)
#define ALL(v) v.begin(),v.end()
#define PB(a) push_back(a)
#define INF 1000000001
#define MOD 1000000007
#define EPS 1e-9

const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };

typedef long long ll;
using namespace std;

ll piyo(ll a) {
	if (a < 4) return a + 1;
	else if (a < 9) return a;
	else return a - 1;
}

ll fuga(ll a) {
	if (a == 4 || a == 9) return 0;
	else return 1;

}

ll hoge(ll a) {
	if (a == 0) return -1;
	ll n = log10(a);
	ll h = pow(10, n);
	ll tmp = a;
	ll ret = 0;
	vector<ll> dp(n + 1);
	ll s = 8;
	dp[0] = piyo(tmp%10);
	REP(i, n) {
		tmp /= 10;
		dp[i + 1] = (piyo(tmp % 10)-fuga(tmp%10))* s;
		dp[i + 1] += dp[i] * fuga(tmp % 10);
		
		s *= 8;
	}

	return a - dp[n];

}


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll a, b;
	cin >> a >> b;
	cout << hoge(b) - hoge(a-1) << endl;
	return 0;
}

Submission Info

Judge Result