Advertisement
Guest User

Untitled

a guest
Oct 26th, 2016
50
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.86 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef pair<ll, int> ii;
  7. #define fr first
  8. #define sc second
  9. #define mp make_pair
  10.  
  11. ll lcm(int x, int y)
  12. {
  13.     return 1LL * x * y / __gcd(x, y);
  14. }
  15.  
  16. int main()
  17. {
  18.     int n;
  19.     while (cin >> n)
  20.     {
  21.         if (n == 0) return 0;
  22.         int c1, n1;
  23.         int c2, n2;
  24.         scanf("%d%d", &c1, &n1);
  25.         scanf("%d%d", &c2, &n2);
  26.  
  27.         ll mn  = LLONG_MAX;
  28.         int m1 = 0, m2 = 0;
  29.         for (int i = 0; i * n1 <= n; i++)
  30.         {
  31.             int k = n - i*n1;
  32.             if (k % n2) continue;
  33.             if (i*c1 + k/n2 * c2 < mn)
  34.             {
  35.                 m1 = i;
  36.                 m2 = k/n2;
  37.                 mn = i*c1 + k/n2 * c2;
  38.             }
  39.         }
  40.  
  41.         if (mn == LLONG_MAX) puts("failed");
  42.         else printf("%d %d\n", m1, m2);
  43.     }
  44. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement