#include<cstdio> using namespace std; typedef long long LL; #define REP(i,a,b) for(LL i=a; i<=b; ++i) LL min(LL a, LL b) { return (a<b) ? a : b ; } LL max(LL a, LL b) { return (a>b) ? a : b ; } LL f(LL n) { LL wyn = 0; while( n > 0 ) { wyn += ( n % 10 ) * ( n % 10 ); n /= 10; } return wyn; } int main() { LL k, a, b, Smin, Smax, wyn = 0, tmp; scanf( "%lld %lld %lld", &k, &a, &b ); Smin = max( 1, ( a + k - 1 ) / k ); Smax = min( 1458, b / k ); REP(S,Smin,Smax) { tmp = k * S; if( k * f( tmp ) == tmp ) { ++wyn; } } printf( "%lld\n", wyn ); 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 57 58 59 60 61 62 63 | #include<cstdio> using namespace std; typedef long long LL; #define REP(i,a,b) for(LL i=a; i<=b; ++i) LL min(LL a, LL b) { return (a<b) ? a : b ; } LL max(LL a, LL b) { return (a>b) ? a : b ; } LL f(LL n) { LL wyn = 0; while( n > 0 ) { wyn += ( n % 10 ) * ( n % 10 ); n /= 10; } return wyn; } int main() { LL k, a, b, Smin, Smax, wyn = 0, tmp; scanf( "%lld %lld %lld", &k, &a, &b ); Smin = max( 1, ( a + k - 1 ) / k ); Smax = min( 1458, b / k ); REP(S,Smin,Smax) { tmp = k * S; if( k * f( tmp ) == tmp ) { ++wyn; } } printf( "%lld\n", wyn ); return 0; } |