Submission #4018714

---

Source Code Expand

// Last Change: 01/15/2019 16:39:40.
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;
using ll = long long;


int main() {
  string A, B;
  cin >> A >> B;
  if (B.size() <= 5) {
    ll aNum, bNum, count;
    count = 0;
    aNum = stoi(A);
    bNum = stoi(B);

    for (ll i = aNum; i <= bNum; i++) {
      bool able = true;
      ll warare = i; //割られる数

      for (int j = 4; j >= 0; j--) {
        int syou; //商

        //割る数の作成
        ll qua = 1;
        for (int k = 0; k < j; k++) {
          qua = qua * 10;
        }

        syou = warare / qua;
        warare = warare % qua;
        if (syou == 4 || syou == 9) {
          able = false;
          break;
        }
      }
      if (!able) {
        ++count;
      }
    }
    cout << count << endl;
    return 0;
  }
  cout<<0<<endl;
}

Submission Info

Judge Result