#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;
}
#include <cstdlib>
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
int n;
cout<<"Введите количество элементов массива."<<endl;
cin>>n;
int mas1[n];
int mas2[n];
for(int i=0; i<n; i++){
mas1[i] = rand()%100; //Заполняем массив случайными числами от 0 до 100
if(mas1[i]%10 == 4) {
mas2[i]=mas1[i]/2;
cout<<"Замена! ";
}
else {cout<<"\t";
mas2[i]=mas1[i];
}
cout<<mas1[i]<<'\t'<<mas2[i]<<endl;
}
system("PAUSE");
return EXIT_SUCCESS;
}