#include <bits/stdc++.h> using namespace std; #define rep(a, b) for (int a = 0; a < (b); a++) #define rep1(a, b) for (int a = 1; a <= (b); a++) #define all(x) (x).begin(), (x).end() using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; const int MOD = 1e9 + 7; #define LOCAL false int sh, sw; int n; int sizes[69]; ll get(int h, int w) { if (h > w) swap(h, w); if (h == 0) return 0; int s = -1; for (int i = n-1; i >= 0; i--) if (sizes[i] <= h) { s = sizes[i]; break; } if (s == -1) { cout << "-1\n"; exit(0); } int hc = h/s; int wc = w/s; return (ll)hc*wc + get(h-hc*s, wc*s) + get(h, w%s); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); if (LOCAL) { ignore=freopen("io/in", "r", stdin); ignore=freopen("io/out", "w", stdout); } cin >> sh >> sw; cin >> n; rep(i, n) cin >> sizes[i]; cout << get(sh, sw) << '\n'; return 0; }
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 | #include <bits/stdc++.h> using namespace std; #define rep(a, b) for (int a = 0; a < (b); a++) #define rep1(a, b) for (int a = 1; a <= (b); a++) #define all(x) (x).begin(), (x).end() using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; const int MOD = 1e9 + 7; #define LOCAL false int sh, sw; int n; int sizes[69]; ll get(int h, int w) { if (h > w) swap(h, w); if (h == 0) return 0; int s = -1; for (int i = n-1; i >= 0; i--) if (sizes[i] <= h) { s = sizes[i]; break; } if (s == -1) { cout << "-1\n"; exit(0); } int hc = h/s; int wc = w/s; return (ll)hc*wc + get(h-hc*s, wc*s) + get(h, w%s); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); if (LOCAL) { ignore=freopen("io/in", "r", stdin); ignore=freopen("io/out", "w", stdout); } cin >> sh >> sw; cin >> n; rep(i, n) cin >> sizes[i]; cout << get(sh, sw) << '\n'; return 0; } |