Pagini recente » Cod sursa (job #155570) | Cod sursa (job #1837936) | Cod sursa (job #3236880) | Cod sursa (job #2084153) | Cod sursa (job #3148969)
#include <fstream>
using namespace std;
ifstream fin("pascal.in");
ofstream fout("pascal.out");
const int DN = 5e6 + 5;
long long R,D, sol, main_two, main_five, two, five, main_three, three, d2, d3, d5;
long long get_pow(long long N, long long O) {
long long nr = 0, cnt = 0, P = O;
while(P <= N) {
cnt += 1;
nr += N / P;
P = P * O;
// if (cnt > 3)
// break;
}
return nr;
}
int main() {
// your code goes here
fin >> R >> D;
main_two = get_pow(R, 2);
main_five = get_pow(R, 5);
main_three = get_pow(R, 3);
d2 = 0;
if (D % 2 == 0)
d2 ++;
if (D % 4 == 0)
d2 ++;
if (D % 3 == 0)
d3 ++;
if (D % 5 == 0)
d5 ++;
int lm = R / 2;
for (int j = 0; j<= (R / 2) + (R % 2); j++) {
if (D % 2 == 0){
two = main_two - get_pow(j, 2) - get_pow(R - j, 2);
}
if (D % 5 == 0){
five = main_five - get_pow(j, 5) - get_pow(R - j, 5);
}
if (D % 3 == 0){
three = main_three - get_pow(j, 3) - get_pow(R - j, 3);
}
if (two >= d2 && five >= d5 && three >= d3) {
sol++;
if (!(j < (R / 2) + (R % 2) && (R%2) == 0) )
sol ++;
}
}
fout << sol;
return 0;
}