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
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 30;

ll d[N];

struct prostokat {
    ll wys, szer, ilosc;
    prostokat(ll a, ll b, ll quant) {
        wys = max(a, b);
        szer = min(a, b);
        ilosc = quant;
    }
};

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll h, w;
    int n;
    cin >> h >> w >> n;

    for(int i = 0; i < n; i++)
        cin >> d[i];

    queue <prostokat> q;
    q.push(prostokat(h, w, 1));

    ll wyn = 0;

    while(!q.empty()) {
        prostokat x = q.front();
        q.pop();

        if(d[0] > x.szer) {
            cout << "-1\n";
            return 0;
        }

        for(int i = n - 1; i >= 0; i--) {
            if(d[i] <= x.szer) {
                ll nowe = x.wys / d[i];
                wyn += nowe * x.ilosc;
                if(x.szer - d[i] > 0)
                    q.push(prostokat(d[i], x.szer - d[i], nowe * x.ilosc));
                if(x.wys - nowe * d[i] > 0)
                    q.push(prostokat(x.wys - nowe * d[i], x.szer, x.ilosc));
                break;
            }
        }
    }

    cout << wyn << "\n";
}