Pagini recente » Cod sursa (job #2611210) | Cod sursa (job #1868451) | Cod sursa (job #2136149) | Cod sursa (job #2661909) | Cod sursa (job #2769122)
#include <fstream>
using namespace std;
ifstream f("pascal.in");
ofstream g("pascal.out");
int R, D,
fp[3], ex[3], nf,
ed[3];
void descfp()
{
switch(D)
{
case 2:
case 3:
case 5:
nf = 1;
fp[1] = D;
ex[1] = 1;
break;
case 4:
nf = 1;
fp[1] = 2;
ex[1] = 2;
break;
case 6:
nf = 2;
fp[1] = 2;
fp[2] = 3;
ex[1] = ex[2] = 1;
}
}
int expp(int n, int p)
{
int e = 0;
while(n % p == 0)
{
e++;
n /= p;
}
return e;
}
bool divid(int k)
{
bool ok = 1;
for(int i = 1; i <= nf; i++)
{
ed[i] += expp(R - k + 1, fp[i]) - expp(k, fp[i]);
if(ed[i] < ex[i])
ok = 0;
}
return ok;
}
int main()
{
int nrd = 0;
f >> R >> D;
if(R >= 2)
{
descfp();
int r2 = (R + 1) / 2;
for(int k = 1; k < r2; k++)
nrd += divid(k);
nrd *= 2;
if(R % 2 == 0)
nrd += divid(r2);
}
g << nrd;
f.close();
g.close();
return 0;
}