Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- typedef long long ll;
- typedef pair<ll, int> ii;
- #define fr first
- #define sc second
- #define mp make_pair
- ll lcm(int x, int y)
- {
- return 1LL * x * y / __gcd(x, y);
- }
- int main()
- {
- int n;
- while (cin >> n)
- {
- if (n == 0) return 0;
- int c1, n1;
- int c2, n2;
- scanf("%d%d", &c1, &n1);
- scanf("%d%d", &c2, &n2);
- ll mn = LLONG_MAX;
- int m1 = 0, m2 = 0;
- for (int i = 0; i * n1 <= n; i++)
- {
- int k = n - i*n1;
- if (k % n2) continue;
- if (i*c1 + k/n2 * c2 < mn)
- {
- m1 = i;
- m2 = k/n2;
- mn = i*c1 + k/n2 * c2;
- }
- }
- if (mn == LLONG_MAX) puts("failed");
- else printf("%d %d\n", m1, m2);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement