Pagini recente » Cod sursa (job #2106215) | Cod sursa (job #2374034) | Cod sursa (job #2794563) | Cod sursa (job #3156621) | Cod sursa (job #140973)
Cod sursa(job #140973)
#include <iostream>
#include <fstream>
using namespace std;
int R,
D,
P;
long pN, pK, pNK;
long divs[30];
int main(int argc, char *argv[]) {
ifstream fin("pascal.in");
fin >> R >> D;
fin.close();
for (long i = D; i <= R; i *= D) {
pN += R / i;
divs[++P] = i;
}
/*for (int i(1); i <= P; ++i)
cout << divs[i] << " ";
cout << endl;*/
pNK = pN;
pK = 0;
int aux, i;
long res(0);
for (int k(1); k <= R / 2; ++k) {
// pK
aux = k;
i = 0;
while (aux % D == 0) {
aux /= D;
++i;
}
pK += i;
aux = R - k + 1;
i = 0;
while (aux % D == 0) {
aux /= D;
++i;
}
pNK -= i;
//cout << k << " " << pK << " " << pNK << endl;
if (pN - pK - pNK)
if ((R % 2 == 0) && (k == R / 2))
++res;
else
res += 2;
}
ofstream fout("pascal.out");
fout << res << endl;
fout.close();
return 0;
}