Submission #574996

---

Source Code Expand

//#include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <vector>
#include <cmath>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <numeric>
#include <functional>
using namespace std;


#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = n; i < (int)(m); i++)
#define INF 1000000007

typedef long long ll;
typedef long double ld;
ll dy[4]={-1,1,0,0};
ll dx[4]={0,0,1,-1};

/*---------- template ----------*/

int A,D;

int main(){
    cin >> A >> D;
    
    cout << max((A+1)*D,A*(D+1)) << endl;
    
    return 0;
}

Submission Info

Judge Result