//
// main.cpp
// potyczki
//
// Created by PJ on 22.09.2015.
// Copyright © 2015 redreni. All rights reserved.
//
#include <iostream>
#define lint unsigned long long int
using namespace std;
lint k, a, b;
lint f(lint x){
lint res=0;
while (x>=1) {
res+=(x%10)*(x%10);
x/=10;
}
return res;
}
lint i, ii, ilet, j;
int main(int argc, const char * argv[]) {
cin>>k>>a>>b;
lint ile =0;
lint fi = f(a-1);
for(i = a; i<=b;){
ii=i;
ilet=0;
while(ii%10==0){
ilet++;
ii/=10;
}
fi-=(81*ilet);
j=ii%10;
if(j!=0){
fi+=j*2-1;
}
if(k*fi==i){
ile++;
}
i++;
}
cout<<ile<<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 | // // main.cpp // potyczki // // Created by PJ on 22.09.2015. // Copyright © 2015 redreni. All rights reserved. // #include <iostream> #define lint unsigned long long int using namespace std; lint k, a, b; lint f(lint x){ lint res=0; while (x>=1) { res+=(x%10)*(x%10); x/=10; } return res; } lint i, ii, ilet, j; int main(int argc, const char * argv[]) { cin>>k>>a>>b; lint ile =0; lint fi = f(a-1); for(i = a; i<=b;){ ii=i; ilet=0; while(ii%10==0){ ilet++; ii/=10; } fi-=(81*ilet); j=ii%10; if(j!=0){ fi+=j*2-1; } if(k*fi==i){ ile++; } i++; } cout<<ile<<endl; return 0; } |
English