ответ:from math import gcd
def reduce(a, b):
k = gcd(a, b)
return a // k, b // k
def take2s(b: int) -> int:
return b if b % 2 != 0 else take2s(b // 2)
def take5s(b: int) -> int:
return b if b % 5 != 0 else take5s(b // 5)
def take10s(b: int) -> int:
return take5s(take2s(b))
def isFinie(b: int) -> bool:
return take10s(b) == 1
a, b = int(input()), int(input())
a, b = reduce(a, b)
print("yes" if isFinie(b) else "no")
Объяснение:
#include <iostream>
typedef long long ll;
using namespace std;
bool ll_is_valid(ll t, ll N, ll x, ll y)
{
return t / x + (t - x) / y >= N;
}
ll f(ll N, ll x, ll y)
{
ll R = 1;
while (!ll_is_valid(R,N,x,y)) R *= 2;
ll L = R / 2;
while(R - L > 1)
{
ll M = (L + R) / 2;
if (!ll_is_valid(M,N,x,y)) {L = M;}
else {R = M;}
}
return R;
}
int main()
{
ll N,x,y;
cin >> N >> x >> y;
if(x > y) swap( x, y );
cout << f(N, x, y) << std::endl;
}
Я пыталась решить но не получилось Прости (