Submission #3413865

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <cmath>

#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue

using namespace std;
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
const int inf = 1e9;
const ll linf = 1LL << 50;

ll calc(ll x) {
  string s = to_string(x);
  ll res = 0;
  ll same = 1;
  for(int i = 0; i < s.size(); i++){
    res = res * 8;
    for(int j = 0; j < int(s[i] - '0'); j++){
      if(j != 4 && j != 9)res += same;
    }
    if(s[i] == '4' || s[i] == '9')same = 0;
  }
  if(same == 1)res++;
  return x - res;
}

int main(int argc, char const* argv[])
{
  ll a, b;
  cin >> a >> b;
  cout << calc(b) - calc(a - 1) << endl;
	return 0;
}

Submission Info

Judge Result