Pagini recente » Cod sursa (job #2727546) | Cod sursa (job #2528361) | Cod sursa (job #1521339) | Cod sursa (job #437134) | Cod sursa (job #874497)
Cod sursa(job #874497)
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
int main() {
ifstream f("pascal.in");
ofstream g("pascal.out");
int r, d, sol = 0, div[7], i, j, k;
memset(div, 0, 7*sizeof(int));
f>>r>>d;
for(i=1; i*2 <= r; i++) {
k = r - i + 1;
while(k % 2 == 0) k /= 2, div[2]++;
while(k % 3 == 0) k /= 3, div[3]++;
while(k % 5 == 0) k /= 5, div[5]++;
k = i;
while(k % 2 == 0) k /= 2, div[2]--;
while(k % 3 == 0) k /= 3, div[3]--;
while(k % 5 == 0) k /= 5, div[5]--;
div[4] = div[2] / 2;
div[6] = min(div[2], div[3]);
if(div[d] >= 1) sol+=2;
if(div[d] >= 1 && i*2 == r) sol--;
}
g<<sol<<"\n";
cout<<sol<<"\n";
return 0;
}