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
#include<iostream>
#include<vector>
using namespace std;
int main()
{
    //ios_base::sync_with_stdio(false);
    //cin.tie(nullptr);
    //cout.tie(nullptr);
    long long int n, ww, hh, o=0;
    cin>>hh>>ww;
    cin>>n;
    int t[n];
    long long int p=ww*hh;
    vector<int> h;
    vector<int> w;
    h.push_back(hh);
    w.push_back(ww);
    for(int i=0; i<n; i++)
    {
        cin>>t[i];
    }
    if (p % t[0] != 0)
    {
        cout<<"-1";
        return 0;
    }
    for (int i=n-1; i>=0; i--)
    {
        for(int j=h.size()-1; j>=0; j--)
        {
            if(t[i]<=h[j] && t[i]<=w[j])
            {
                if(w[j]<h[j])
                {
                    o+=h[j]/t[i];
                    if(h[j]%t[i]!=0)
                    {
                        h.push_back(h[j]%t[i]);
                        w.push_back(t[i]);
                    }
                    h[j]-=t[i];
                }
                else
                {
                    o+=w[j]/t[i];
                    if(w[j]%t[i]!=0)
                    {
                        w.push_back(w[j]%t[i]);
                        h.push_back(t[i]);
                    }
                    w[j]-=t[i];
                }
                if(w[w.size()-1]==0)
                {
                    w.pop_back();
                    h.pop_back();
                }
                if(h[h.size()-1]==0)
                {
                    w.pop_back();
                    h.pop_back();
                }
            }
        }
    }
    cout<<o;
    return 0;
}