Pagini recente » Cod sursa (job #1864976) | Monitorul de evaluare | Cod sursa (job #2903880) | Cod sursa (job #2228414) | Cod sursa (job #2215261)
#include <bits/stdc++.h>
using namespace std;
int r, m, lgr;
int k;
int legp(int p, int a)
{
int rez = 0, p1 = p;
for(int i = 1; a / p1; i++, p1 *= p)
rez += a / p1;
return rez;
}
bool ok(int i)
{
int mi = -1;
int m1 = m, x = 2;
while(m1 > 1)
{
if(x * x > m1)
x = m1;
int e = 0;
while(m1 % x == 0)
{
m1 /= x;
e++;
}
if(e > 0)
{
int lg1, lg2;
lg1 = legp(x, r) / e;
lg2 = (legp(x, i) + legp(x, r - i)) / e;
if(lg1 - lg2 < mi || mi == -1)
mi = lg1 - lg2;
}
x++;
}
return (mi != 0);
}
int main()
{
ifstream fin ("pascal.in");
ofstream fout ("pascal.out");
fin >> r >> m;
for(int i = 0; i < (r + 1) / 2; i++)
k += ok(i) * 2;
if(r % 2 == 0)
k += ok(r / 2);
fout << k << "\n";
return 0;
}