【題解】Codeforces EDU Course-2 Lesson-6-2 C. Very Easy Task

#include <iostream>
#include <algorithm>

using namespace std;
 
int n, x, y;
long long int ptr1 = 0, ptr2 = 0;   // time of the two printers
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> x >> y;
     
    if (x > y) swap(x, y);
     
    n--; 
    while (n) {
        if (ptr1 <= ptr2) {
            ptr1 += x;
        } else {
            ptr2 += y;
        }
        n--;
    }
     
    cout << max(ptr1, ptr2) + x << "\n";
     
    return 0;
}