//Daniel Grzegorzewski #include <bits/stdc++.h> #define MP make_pair #define PB push_back #define ST first #define ND second #define int long long using namespace std; typedef pair<int, int> PII; typedef vector<int> VI; typedef vector<PII> VII; typedef long long LL; void init_ios() { ios_base::sync_with_stdio(0); cin.tie(0); } int k, a, b, res; int f(int x) { int res = 0; while (x) { int co = x%10; res += co*co; x /= 10; } return res; } #undef int int main() { #define int long long init_ios(); cin >> k >> a >> b; for (int i = 1; i*k <= b && i <= 1500; ++i) if (f(i*k) == i && i*k >= a) ++res; cout<<res<<"\n"; }
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 | //Daniel Grzegorzewski #include <bits/stdc++.h> #define MP make_pair #define PB push_back #define ST first #define ND second #define int long long using namespace std; typedef pair<int, int> PII; typedef vector<int> VI; typedef vector<PII> VII; typedef long long LL; void init_ios() { ios_base::sync_with_stdio(0); cin.tie(0); } int k, a, b, res; int f(int x) { int res = 0; while (x) { int co = x%10; res += co*co; x /= 10; } return res; } #undef int int main() { #define int long long init_ios(); cin >> k >> a >> b; for (int i = 1; i*k <= b && i <= 1500; ++i) if (f(i*k) == i && i*k >= a) ++res; cout<<res<<"\n"; } |