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
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int h, w;
    cin>>h>>w;
    int n;
    cin>>n;
    vector<int> vec(n);
    for(int i=0; i<n; i++)
        cin>>vec[i];
    if(h%vec[0]!=0 || w%vec[0]!=0)
    {
        cout<<"-1";
        return 0;
    }
    long long result = 0;
    int top = 0, right = 0;
    for(int i=n-1; i>=0; i--)
    {
        if(vec[i] <= w)
        {
            int div = w / vec[i];
            w -= div * vec[i];
            result += (long long)div * right / vec[i];
            top += div * vec[i];
        }
        if(vec[i] <= h)
        {
            int div = h / vec[i];
            h -= div * vec[i];
            result += (long long)div * top / vec[i];
            right += div * vec[i];
        }
    }
    cout<<result;
    return 0;
}