Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <algorithm>
- using namespace std;
- long long kk(long long a, long long b, long long w, long long h){
- long long res = (w / a)*(h / b) ;
- int a1 = w%a;
- if(a1>= b)
- res += kk(b, a, a1, h);
- if (w >= a && h >= b)
- return res;
- return 0;
- }
- long long maxCount(long long a, long long b, long long w, long long h){
- return max(kk(a,b,w,h), kk(b,a,w,h));
- }
- int main(){
- long long n, a, b, w, h;
- scanf("%I64d%I64d%I64d%I64d%I64d", &n, &a, &b, &w, &h);
- long long maxD = 0;
- for(long long i = 0; i < 1e18; i++)
- if (maxCount(a + 2*i, b + 2*i, w, h) >= n)
- maxD = i;
- else break;
- printf("%I64d", maxD);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement