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
#include <iostream>

using namespace std;

int f(unsigned long long x){

unsigned long long sum=0;
while (x>0) {
sum=sum+(x%10)*(x%10);
x=x/10;
}
return sum;
}

int main(){
unsigned long long k, a, b, n, t;
int count;

cin >> k>> a >> b;

count=0;

for (n=a; n<=b; n++){
		
		if (n%k==0) {
			if (f(n)==n/k) {count++; //cout << n << endl;//
			}
		}
		//else
		//	if (k*f(n)==n) {count++; cout << n << endl;}
}

cout << count;

return 0;
}