Pagini recente » Cod sursa (job #1195142) | Cod sursa (job #3264290) | Cod sursa (job #2626269) | Cod sursa (job #2254473) | Cod sursa (job #3169666)
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define x first
#define y second
#define int long long
#ifndef LOCAL
const string name = "gfact";
ifstream in(name+".in");
ofstream out(name+".out");
#define cin in
#define cout out
#endif // FIO
int p,q;
vector<pii> primes;
int32_t main()
{
cin>>p>>q;
int a=p;
int i=2;
while(i*i<=a)
{
int j=0;
while(a%i==0)
{
j++;
a/=i;
}
if(j>0)
{
primes.push_back({i,j});
}
i++;
cout<<"here "<<i<<' '<<a<<'\n';
}
if(a>0)
{
primes.push_back({a,1});
}
int ans=0;
for(auto e:primes)
{
int goal=e.y*q;
int mynum=0;
while(goal>0)
{
int add=1, mxpow=1;
while(add<=goal)
{
add=add*e.x+1;
mxpow++;
}
mxpow--;
add=(add-1)/e.x;
mynum+=pow(e.x, mxpow);
goal-=add;
}
cerr<<"debug "<<e.x<<' '<<goal<<' '<<mynum<<'\n';
ans=max(ans, mynum);
}
cout<<ans<<'\n';
return 0;
}