Pagini recente » Cod sursa (job #3001233) | Cod sursa (job #1128517) | Cod sursa (job #3325643) | Cod sursa (job #3330599) | Cod sursa (job #3304359)
#include <fstream>
using namespace std;
const long long INF = 1LL << 62;
int nrf, fp[20], ex[20];
long long exfact[20];
ifstream f("zero2.in");
ofstream g("zero2.out");
void desc(int x)
{
nrf = 0;
for(int d = 2; 1LL * d * d <= x; d++)
if(x % d == 0)
{
nrf++;
fp[nrf] = d;
ex[nrf] = 0;
do
{
ex[nrf]++;
x /= d;
}
while(x % d == 0);
}
//
if(x > 1)
nrf++, fp[nrf] = x, ex[nrf] = 1;
}
void expo(int n)
{
for(int i = 1; i <= nrf; i++)
{
exfact[i] = 0;
long long p = fp[i];
//
while(n >= p)
{
int k = n / p;
exfact[i] += p * k * (k - 1) / 2;
exfact[i] += (n - k * p + 1) * k;
p *= fp[i];
}
}
}
int main()
{
int n, B, t = 10;
long long nrz;
while(t--)
{
f >> n >> B;
desc(B);
expo(n);
nrz = INF;
for(int i = 1; i <= nrf; i++)
nrz = min(nrz, exfact[i] / ex[i]);
g << nrz << '\n';
}
f.close();
g.close();
return 0;
}