#include <iostream> #include <cmath> using namespace std; int digit_square(int x){ int n = ceil(log10(x)); int d,dd; int result = 0; for (int i=1; i<=n; i++){ dd = int(pow(10,i)); d =10*(x%dd)/dd; x = x - d*dd/10; result+=d*d; } return result; } int main() { int k, a, b; int count = 0; cin>>k>>a>>b; a = a - a % k + k; b = b - b % k; for(int i = a; i<=b; i+=k){ if( digit_square(i) == i/k){ count++;} } cout<<count; return 0; }
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 | #include <iostream> #include <cmath> using namespace std; int digit_square(int x){ int n = ceil(log10(x)); int d,dd; int result = 0; for (int i=1; i<=n; i++){ dd = int(pow(10,i)); d =10*(x%dd)/dd; x = x - d*dd/10; result+=d*d; } return result; } int main() { int k, a, b; int count = 0; cin>>k>>a>>b; a = a - a % k + k; b = b - b % k; for(int i = a; i<=b; i+=k){ if( digit_square(i) == i/k){ count++;} } cout<<count; return 0; } |