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
#include <iostream>
using namespace std;

int main()
{
	long long k, a, b;
	cin>>k>>a>>b;
	int wyn=0;
	for (int f=1, maksF=18*9*9; f<=maksF; ++f)
	{
		long long n=k*f;
		if (b<n)
			break;
		if (n<a)
			continue;
		int j=0;
		while (n)
		{
			int c=n%10;
			j+=c*c;
			n/=10;
		}
		if (j==f)
			++wyn;
	}
	cout<<wyn<<endl;
	return 0;
}