#include<iostream> #include<cstdio> #include<cstdlib> #include<cmath> #include<algorithm> #include<vector> #include<set> #include<map> #include<stack> #include<queue> #include<list> #include<string> #include<cstring> using namespace std; #define PB push_back #define MP make_pair #define F first #define S second #define ALL(x) (x).begin(),(x).end() #define SIZE(x) (int)(x).size() #define SORT(x) sort((x).begin(),(x).end()) #define CLEAR(tab) memset(tab, 0, sizeof(tab)) #define REP(x, n) for(int x = 0; x < (n); x++) #define FOR(x, b, e) for(int x = (b); x <= (e); x++) #define FORD(x, b, e) for(int x = (b); x >= (e); x--) #define VAR(v, n) __typeof(n) v = (n) #define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define DEBUG(fmt, ...) fprintf(stderr, fmt, ##__VA_ARGS__) const int MAX_BUF_SIZE = 16384; char BUFOR[MAX_BUF_SIZE]; int BUF_SIZE, BUF_POS; char ZZZ; #define GET(ZZZ){ZZZ='a';if(BUF_POS<BUF_SIZE)ZZZ=BUFOR[BUF_POS++];\ else if(!feof(stdin)){BUF_SIZE=fread(BUFOR,1,MAX_BUF_SIZE,stdin);\ ZZZ=BUFOR[0];BUF_POS=1;}} #define GI(WW){do{GET(ZZZ);}while(!isdigit(ZZZ));WW=ZZZ-'0';\ while(1){GET(ZZZ);if(!isdigit(ZZZ))break;WW=WW*10+(ZZZ-'0');}} #define GC(WW){do{GET(ZZZ);}while(!isalpha(ZZZ));WW=ZZZ;} //FAST IO typedef long long int LL; typedef pair<int,int> PII; typedef vector<int> VI; const int MXN = 1000010; const int C = 262144; const int INF = 1000000001; const int M = 18; LL sum(LL x) { LL res = 0; while(x) { res += (x % 10) * (x % 10); x /= 10; } return res; } LL solve(LL n, LL k) { int res = 0; FOR(i, 1, M * 81) if(log(k) + log(i) <= log(n) && sum(k * i) == i && k * i <= n) res++; return res; } int main() { LL k, a, b; scanf("%lld %lld %lld", &k, &a, &b); printf("%lld\n", solve(b, k) - solve(a - 1, k) ); 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 64 65 66 67 68 69 70 71 72 73 74 75 76 77 | #include<iostream> #include<cstdio> #include<cstdlib> #include<cmath> #include<algorithm> #include<vector> #include<set> #include<map> #include<stack> #include<queue> #include<list> #include<string> #include<cstring> using namespace std; #define PB push_back #define MP make_pair #define F first #define S second #define ALL(x) (x).begin(),(x).end() #define SIZE(x) (int)(x).size() #define SORT(x) sort((x).begin(),(x).end()) #define CLEAR(tab) memset(tab, 0, sizeof(tab)) #define REP(x, n) for(int x = 0; x < (n); x++) #define FOR(x, b, e) for(int x = (b); x <= (e); x++) #define FORD(x, b, e) for(int x = (b); x >= (e); x--) #define VAR(v, n) __typeof(n) v = (n) #define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define DEBUG(fmt, ...) fprintf(stderr, fmt, ##__VA_ARGS__) const int MAX_BUF_SIZE = 16384; char BUFOR[MAX_BUF_SIZE]; int BUF_SIZE, BUF_POS; char ZZZ; #define GET(ZZZ){ZZZ='a';if(BUF_POS<BUF_SIZE)ZZZ=BUFOR[BUF_POS++];\ else if(!feof(stdin)){BUF_SIZE=fread(BUFOR,1,MAX_BUF_SIZE,stdin);\ ZZZ=BUFOR[0];BUF_POS=1;}} #define GI(WW){do{GET(ZZZ);}while(!isdigit(ZZZ));WW=ZZZ-'0';\ while(1){GET(ZZZ);if(!isdigit(ZZZ))break;WW=WW*10+(ZZZ-'0');}} #define GC(WW){do{GET(ZZZ);}while(!isalpha(ZZZ));WW=ZZZ;} //FAST IO typedef long long int LL; typedef pair<int,int> PII; typedef vector<int> VI; const int MXN = 1000010; const int C = 262144; const int INF = 1000000001; const int M = 18; LL sum(LL x) { LL res = 0; while(x) { res += (x % 10) * (x % 10); x /= 10; } return res; } LL solve(LL n, LL k) { int res = 0; FOR(i, 1, M * 81) if(log(k) + log(i) <= log(n) && sum(k * i) == i && k * i <= n) res++; return res; } int main() { LL k, a, b; scanf("%lld %lld %lld", &k, &a, &b); printf("%lld\n", solve(b, k) - solve(a - 1, k) ); return 0; } |