CF821B Okabe and Banana Trees

思路：

暴力枚举。

实现：

 #include <iostream>
 #include <cstdio>
 using namespace std;
 typedef long long ll;
 ll m, b;
 int main()
 {
     cin >> m >> b;
     ll maxn = ;
     for (ll i = ; i <= m * b; i++)
     {
         ll j = - i / m + b;
         if (m * j + i - m * b <= )
         {
             ll ans = (i + ) * (j + ) * (i + j) / ;
             if (ans > maxn)
                 maxn = ans;
         }
     }
     cout << maxn << endl;
     return ;
 }