Pagini recente » Cod sursa (job #2235469) | Cod sursa (job #3292002) | Cod sursa (job #1885539) | Cod sursa (job #2210072) | Cod sursa (job #2195770)
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("pascal.in");
ofstream out("pascal.out");
//short ap[3][50000000];
/*
void computeFact(int n) {
for(int i = 2; i <= n; i++) {
int k = i, c = 0;
while(k%2 == 0) {
k /= 2;
c++;
}
ap[0][i] = ap[0][i-1]+c;
k = i;
while(k%3 == 0) {
k /= 3;
c++;
}
ap[1][i] = ap[1][i-1]+c;
k = i;
while(k%5 == 0) {
k /= 5;
c++;
}
ap[2][i] = ap[2][i-1]+c;
}
}*/
int legendre(int n, int k) {
int r = n/k, s = 0, exp = k;
while(r != 0) {
s += r;
exp *= k;
r = n/exp;
}
return s;
}
int main()
{
int r, d, s = 0, ap[0];
in >> r >> d;
if(d == 6) {
ap[0] = legendre(r, 2);
ap[1] = legendre(r, 3);
for(int j = 1; j < r; j++) {
if(ap[0] - legendre(j, 2) - legendre(r-j, 2) > 0 && ap[1] - legendre(j, 3) - legendre(r-j, 3) > 0)
s++;
}
} else if (d== 4) {
ap[0] = legendre(r, 2);
for(int j = 1; j < r; j++) {
if(ap[0] - legendre(j, 2) - legendre(r-j, 2) > 1)
s++;
}
} else {
ap[0] = legendre(r, d);
for(int j = 1; j < r; j++) {
if(ap[0] - legendre(j, d) - legendre(r-j, d) > 0)
s++;
}
}
out << s;
return 0;
}