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
63
64
65
66
#include <cstdio>
#include <algorithm>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <cmath>
#include <map>
#include <string>
#include <set>
#include <cstring>
#include <iostream>
#include <sstream>
#include <cassert>

using namespace std;

#define PB push_back
#define FORE(i, t) for(typeof(t.begin())i=t.begin();i!=t.end();++i)
#define SZ(x) int((x).size())
#define REP(i, n) for(int i=0,_=(n);i<_;++i)
#define FOR(i, a, b) for(int i=(a),_=(b);i<=_;++i)
#define FORD(i, a, b) for(int i=(a),_=(b);i>=_;--i)

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

const int INF = 1e9 + 9;
const int MAX_SUM_OF_SQUARES = 19 * 9 * 9;

int compute_sum_of_squares(ll n) {
    int result = 0;
    while (n > 0) {
        int digit = n % 10;
        result += digit * digit;
        n /= 10;
    }
    return result;
}

void inline one() {
    ll k, a, b;
    scanf("%lld%lld%lld", &k, &a, &b);
    int result = 0;
    FOR(sum_of_squares_candidate, 1, MAX_SUM_OF_SQUARES) {
        ll n = (ll) sum_of_squares_candidate * k;
        if (n < a) {
            continue;
        }
        if (n > b) {
            break;
        }
        int sum_of_squares = compute_sum_of_squares(n);
        if (sum_of_squares_candidate == sum_of_squares) {
            result += 1;
            // printf("n=%lld k=%lld ss=%d\n", n, k, sum_of_squares);
        }
    }
    printf("%d\n", result);
}

int main() {
    //int z; scanf("%d", &z); while(z--)
    one();
}