competitive-programming/solved-topcoder/Solved/BearPaints.cpp at master · the-redback/competitive-programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
/**
 *                                   ____
 *       ____ ___  ____ ________  __/ __/
 *      / __ `__ \/ __ `/ ___/ / / / /_
 *     / / / / / / /_/ / /  / /_/ / __/
 *    /_/ /_/ /_/\__,_/_/   \__,_/_/
 *
 *    @link : https://the-redback.com
 */

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long llu;

#define ft        first
#define sd        second
#define mp        make_pair
#define pb(x)     push_back(x)
#define all(x)    x.begin(), x.end()
#define allr(x)   x.rbegin(), x.rend()
#define mem(a, b) memset(a, b, sizeof(a))
#define inf       1e9
#define eps       1e-9
#define mod       1000000007
#define NN        100010

#define read(a) scanf("%lld", &a)

struct BearPaints {
    long long maxArea(ll W, ll H, long long M) {
        long long ret = 0;
        ll tmp = 0, i;
        for (i = 1; i <= W; i++) {
            tmp = M / i;
            tmp = min(tmp, H);

            ret = max(ret, tmp * i);
        }
        for (i = 1; i <= H; i++) {
            tmp = M / i;
            tmp = min(tmp, W);
            ret = max(ret, tmp * i);
        }

        return ret;
    }

    // BEGIN CUT HERE
public:
    void run_test(int Case) {
        if ((Case == -1) || (Case == 0)) test_case_0();
        if ((Case == -1) || (Case == 1)) test_case_1();
        if ((Case == -1) || (Case == 2)) test_case_2();
        if ((Case == -1) || (Case == 3)) test_case_3();
        if ((Case == -1) || (Case == 4)) test_case_4();
    }

private:
    template <typename T>
    string print_array(const vector<T>& V) {
        ostringstream os;
        os << "{ ";
        for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\",";
        os << " }";
        return os.str();
    }
    void verify_case(int Case, const long long& Expected, const long long& Received) {
        cerr << "Test Case #" << Case << "...";
        if (Expected == Received)
            cerr << "PASSED" << endl;
        else {
            cerr << "FAILED" << endl;
            cerr << "\tExpected: \"" << Expected << '\"' << endl;
            cerr << "\tReceived: \"" << Received << '\"' << endl;
        }
    }
    void test_case_0() {
        int Arg0 = 3;
        int Arg1 = 5;
        long long Arg2 = 14LL;
        long long Arg3 = 12LL;
        verify_case(0, Arg3, maxArea(Arg0, Arg1, Arg2));
    }
    void test_case_1() {
        int Arg0 = 4;
        int Arg1 = 4;
        long long Arg2 = 10LL;
        long long Arg3 = 9LL;
        verify_case(1, Arg3, maxArea(Arg0, Arg1, Arg2));
    }
    void test_case_2() {
        int Arg0 = 1000000;
        int Arg1 = 12345;
        long long Arg2 = 1000000000000LL;
        long long Arg3 = 12345000000LL;
        verify_case(2, Arg3, maxArea(Arg0, Arg1, Arg2));
    }
    void test_case_3() {
        int Arg0 = 1000000;
        int Arg1 = 1000000;
        long long Arg2 = 720000000007LL;
        long long Arg3 = 720000000000LL;
        verify_case(3, Arg3, maxArea(Arg0, Arg1, Arg2));
    }
    void test_case_4() {
        int Arg0 = 1000000;
        int Arg1 = 1000000;
        long long Arg2 = 999999999999LL;
        long long Arg3 = 999999000000LL;
        verify_case(4, Arg3, maxArea(Arg0, Arg1, Arg2));
    }

    // END CUT HERE
};

// BEGIN CUT HERE
int main() {
    BearPaints ___test;
    ___test.run_test(-1);
    int gbase;
    cin >> gbase;  // erase this line if you are not using dev-cpp! :)
    return 0;
}
// END CUT HERE