#include <bits/stdc++.h> using namespace std; long long w,h; int n; long long d[60]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>h>>w>>n; for(int i=0;i<n;i++) { cin >> d[i]; } if(w % d[0] != 0 || h % d[0] != 0) { cout << -1; return 0; } long long ret = (w/d[0]) * (h/d[0]); for(int i=1;i<n;i++) { if(d[i] > w || d[i] > h) { break; } long long cover = (w/d[i]) * (h/d[i]); if(cover > 0) { long long mult = d[i] / d[i-1]; ret -= cover * mult * mult; ret += cover; } } cout << ret; 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 | #include <bits/stdc++.h> using namespace std; long long w,h; int n; long long d[60]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>h>>w>>n; for(int i=0;i<n;i++) { cin >> d[i]; } if(w % d[0] != 0 || h % d[0] != 0) { cout << -1; return 0; } long long ret = (w/d[0]) * (h/d[0]); for(int i=1;i<n;i++) { if(d[i] > w || d[i] > h) { break; } long long cover = (w/d[i]) * (h/d[i]); if(cover > 0) { long long mult = d[i] / d[i-1]; ret -= cover * mult * mult; ret += cover; } } cout << ret; return 0; } |