Pagini recente » Cod sursa (job #2021659) | Cod sursa (job #1477098) | Cod sursa (job #2689942) | Cod sursa (job #1251491) | Cod sursa (job #1805857)
#include <cstdio>
const int MAX_N = 5000000;
struct codeFactory {
int e2, e3, e5;
} prec[1+MAX_N], fi, fj, fij, rez;
int main() {
int r, d, nr;
FILE *fin = fopen("pascal.in", "r");
fscanf(fin, "%d%d", &r, &d);
fclose(fin);
for(int i = 1; i <= r; ++i) {
int c = i;
prec[i] = prec[i - 1];
while(c % 2 == 0) {
prec[i].e2++;
c = c / 2;
}
while(c % 3 == 0) {
prec[i].e3++;
c = c / 3;
}
while(c % 5 == 0) {
prec[i].e5++;
c = c / 5;
}
}
fi = prec[r];
nr = 0;
for(int j = 0; j <= r; ++j) {
fj = prec[j];
fij = prec[r - j];
rez.e2 = fi.e2 - fj.e2 - fij.e2;
rez.e3 = fi.e3 - fj.e3 - fij.e3;
rez.e5 = fi.e5 - fj.e5 - fij.e5;
if(d == 2 && rez.e2 > 0)
++nr;
else if(d == 3 && rez.e3 > 0)
++nr;
else if(d == 4 && rez.e2 > 1)
++nr;
else if(d == 5 && rez.e5 > 0)
++nr;
else if(d == 6 && rez.e2 > 0 && rez.e3 > 0)
++nr;
}
FILE *fout = fopen("pascal.out", "w");
fprintf(fout, "%d", nr);
fclose(fout);
return 0;
}