Pagini recente » Cod sursa (job #1826808) | Cod sursa (job #2344957) | Cod sursa (job #999937) | Cod sursa (job #2936223) | Cod sursa (job #1217235)
#include<stdio.h>
#include<math.h>
const int RMAX = 5e6;
int r, d;
int min2, min3, min5, p2[RMAX + 5], p3[RMAX + 5], p5[RMAX + 5];
inline int check (int k) {
return p2[r] - p2[r - k] - p2[k] >= min2 && p3[r] - p3[r - k] - p3[k] >= min3 && p5[r] - p5[r - k] - p5[k] >= min5;
}
int main() {
freopen("pascal.in", "r", stdin);
freopen("pascal.out", "w", stdout);
int j, jum, cj, num, d2, d3, d5;
scanf("%d%d", &r, &d);
jum = r / 2;
min2 = min3 = min5 =0;
if(d == 2)
min2 = 1;
if(d == 3)
min3 = 1;
if(d == 4)
min2 = 2;
if(d == 5)
min5 = 1;
if(d == 6)
min2 = min3 = 1;
for(j = 2; j <= r; ++ j) {
d2 = d3 = d5 = 0;
cj = j;
while((cj & 1) == 0)
++ d2,
cj >>= 1;
cj = j;
while(cj % 3 == 0)
++ d3,
cj /= 3;
cj = j;
while(cj % 5 == 0)
++ d5,
cj /= 5;
p2[j] = p2[j - 1] + d2;
p3[j] = p3[j - 1] + d3;
p5[j] = p5[j - 1] + d5;
}
num = 0;
for(j = 1; j <= jum; ++ j)
if(p2[r] - p2[r - j] - p2[j] >= min2 && p3[r] - p3[r- j] - p3[j] >= min3 && p5[r] - p5[r - j] - p5[j] >= min5)
num += 2;
if(r % 2 == 0)
num -= check(jum);
printf("%d\n", num);
return 0;
}