#include <bits/stdc++.h> using namespace std; typedef unsigned long long ll; int countSquares( ll v ) { int r = 0; while( v ) { int t = v % 10; r += t*t; v /= 10; } return r; } int solver( ll a, ll b, ll k ) { ll maxV = -1; maxV /= 1458; int counter = 0; ll start = ( a / k ) * k; if ( start < a ) start += k; for ( ll i=start; i<=b; i+=k ) { assert( i%k == 0 ); ll r = countSquares( i ); if ( k*r == i ) { ++counter; } if ( k > maxV || i > k*1458 ) break; } return counter; } int main( ) { ll a; ll b; ll k; cin >> k >> a >> b; cout << solver( a, b, k ) << 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 47 48 49 50 51 52 53 54 55 56 | #include <bits/stdc++.h> using namespace std; typedef unsigned long long ll; int countSquares( ll v ) { int r = 0; while( v ) { int t = v % 10; r += t*t; v /= 10; } return r; } int solver( ll a, ll b, ll k ) { ll maxV = -1; maxV /= 1458; int counter = 0; ll start = ( a / k ) * k; if ( start < a ) start += k; for ( ll i=start; i<=b; i+=k ) { assert( i%k == 0 ); ll r = countSquares( i ); if ( k*r == i ) { ++counter; } if ( k > maxV || i > k*1458 ) break; } return counter; } int main( ) { ll a; ll b; ll k; cin >> k >> a >> b; cout << solver( a, b, k ) << endl; return 0; } |