Submission #574985

---

Source Code Expand

#include <cstring>
#include <cmath>
#include <cstdio>
#include <cassert>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <deque>
#include <utility>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <functional>
#include <numeric>
#include <iomanip>
using namespace std;
#define RET return
#define FOR(i,j,k) for(int i=j; i<(int)k; ++i)
#define rep(i,j) for(int i=0;i<(int)j;++i)
#define rep1(i,j) for(int i=1;i<=(int)j;++i)
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define SMAX(x,y) (x)=max((x),(y))
#define SMIN(x,y) (x)=min((x),(y))
#define INF (int)((1ll<<31)-1)
#define INFLL (long long)((1ull<<63)-1)
#define PI 3.14159265358979323846
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
int main(){
    int A, D;
    cin >> A >> D;
    cout << max((A + 1)*D, A*(D + 1)) << '\n';
}

Submission Info

Judge Result