Pagini recente » Cod sursa (job #527977) | Cod sursa (job #827324)
Cod sursa(job #827324)
#include <cstdio>
using namespace std;
int Row, Factor[3] = {2, 3, 5}, DPower[3], Solution;
inline int GetPower(int X, int factor) {
int power = 0;
for (; X % factor == 0; ++power, X /= factor);
return power;
}
void Solve() {
int n = Row;
int Pow[3] = {0, 0, 0};
for (int k = 1; k <= n; ++k) {
int divisible = 1;
for (int i = 0; i < 3; ++i)
divisible &= ((Pow[i] = Pow[i] + GetPower(n - k + 1, Factor[i]) - GetPower(k, Factor[i])) >= DPower[i]);
Solution += divisible;
}
}
void Read() {
freopen("pascal.in", "r", stdin);
int D; scanf("%d %d", &Row, &D);
for (int i = 0; i < 3; ++i)
for (; D % Factor[i] == 0; ++DPower[i], D /= Factor[i]);
}
void Print() {
freopen("pascal.out", "w", stdout);
printf("%d\n", Solution);
}
int main() {
Read();
Solve();
Print();
return 0;
}