/* * runda_probna.cpp * * Created on: 23 wrz 2015 * Author: Kamil */ #include<iostream> using namespace std; long long get_sum_of_digit_squares(long long iter) { long long sum = 0; long long temp; while(iter > 0) { temp = iter % 10; sum += temp*temp; iter /= 10; } return sum; } int main() { long long k, a, b; cin>>k>>a>>b; long long upper_bound = 1458; long long overflow_check = 1000000000000000LL; long long res = 0; long long iter = b; iter -= iter % k; if(k < overflow_check){ if(iter > k*upper_bound) iter = k*upper_bound; } while(iter >= a) { if(iter/k == get_sum_of_digit_squares(iter) ) { res++; } iter -= k; } cout<<res<<endl; 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 36 37 38 39 40 41 42 43 44 45 46 | /* * runda_probna.cpp * * Created on: 23 wrz 2015 * Author: Kamil */ #include<iostream> using namespace std; long long get_sum_of_digit_squares(long long iter) { long long sum = 0; long long temp; while(iter > 0) { temp = iter % 10; sum += temp*temp; iter /= 10; } return sum; } int main() { long long k, a, b; cin>>k>>a>>b; long long upper_bound = 1458; long long overflow_check = 1000000000000000LL; long long res = 0; long long iter = b; iter -= iter % k; if(k < overflow_check){ if(iter > k*upper_bound) iter = k*upper_bound; } while(iter >= a) { if(iter/k == get_sum_of_digit_squares(iter) ) { res++; } iter -= k; } cout<<res<<endl; return 0; } |