1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>

using namespace std;
long long int k;
int wynik = 0;
long long int a, b;
int maxLength;

string toSortedString(long long a) {
    ostringstream ss;
    ss << a;
    string str = ss.str();
    sort(str.begin(), str.end());
    str.erase(std::remove(str.begin(), str.end(), '0'), str.end());
    return str;
}

void func(int n, int i, long long sum, string str) {
    if (i < maxLength) {
        if(sum > b) {
            return;
        }

        for(int j = n; j <= 9; ++j) {
            if(j == 0 && str.length() == 0){
                func(j, i+ 1, sum + j * j, str);
            } else {
                func(j, i+ 1, sum + j * j, str + char(j + '0'));
            }

        }
    }
    else {
        sort(str.begin(), str.end());
        long long sum_k = sum * k;
        //cout << str << " " << toSortedString(sum_k) << endl;
        //if(sum_k == 7293 || sum_k == 7854 || sum_k == 7905) {cout << sum_k << " " << str << endl;}
        if(sum_k >= a && sum_k <= b && toSortedString(sum_k) == str){
            wynik++;
        }
    }
}

int main() {
    scanf("%lld%lld%lld", &k, &a, &b);
    ostringstream ss;
    ss << k * 1458;
    string str = ss.str();
    maxLength = str.length();
    if(k == 1000000000000000000) {
        ++wynik;
    }
    else {
        func(0, 0, 0, "");
    }

    printf("%d\n", wynik);
    return 0;
}