heirsdilemma.cpp

#include <bits/stdc++.h>

using namespace std;

template<typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }

template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
    os << '{';
    string sep;
    for (const T &x: v) os << sep << x, sep = ", ";
    return os << '}';
}
// https://stackoverflow.com/questions/31162367/significance-of-ios-basesync-with-stdiofalse-cin-tienull
#define fast_io ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#define ld long double
#define ll long long
#define vec vector
#define arr array
#define str string

#define print(x) cout << #x << " = " << x << endl;
#define OUT(x) cout << x << "\n";

#define FOR(i, from, to_excl, inc) for (int i = from; i < to_excl; i += inc)
#define FORALL(item, container) for (auto item: container)
#define WHILE(n) while (n-- > 0)

const ll INF = 1e9;
const double EPS = 1e-9;
const ld PI = 3.1415926535897932384626433832795;

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return (a / gcd(a, b)) * b;
}

ll floorMod(const ll a, const ll b) {
    return (a % b + b) % b;
}

vector<string> tokenize(const string &s, char c) {
    vector<string> T;
    stringstream ss = stringstream(s);

    for (string t; getline(ss, t, c);) {
        T.push_back(t);
    }

    return T;
}

string lower(string s) {
    string r(s);
    transform(s.begin(), s.end(), r.begin(), [](unsigned char c) { return tolower(c); });
    return r;
}

string upper(string s) {
    string r(s);
    transform(s.begin(), s.end(), r.begin(), [](unsigned char c) { return toupper(c); });
    return r;
}

bool valid(ll num) {
    // 6 digits
    if (num < 100000 || num > 999999)
        return false;
    // all different
    str num_string = to_string(num);
    map<char, bool> seen;
    for (char c: num_string) {
        seen[c] = false;
    }
    for (char c: num_string) {
        if (seen[c]) {
            // already seen -- not all different
            return false;
        }
        seen[c] = true;
    }
    
    // all non-zero
    for (auto p: seen) {
        if (p.first == '0') {
            return false;
        }
    }

    // divisible by each of its numbers
    FOR(i, 0, num_string.length(), 1) {
        ll d = num_string[i] - 48;
        if (num % d != 0) {
            return false;
        }
    }

    return true;
}

int main() {
    fast_io

    ll l, h, res = 0;
    cin >> l >> h;


    FOR(i, l, h + 1, 1) {
        res += valid(i) ? 1 : 0;
    }

    OUT(res)


    return 0;
}