Given five integers N, A, B, X and Y. The task is to find the maximum profit obtained from the numbers from the range [1, N]. If a positive number is divisible by A then the profit increases by X and if a positive number is divisible by B then the profit increases by Y.
Note: Profit from a positive number can be added at most once.
Input: N = 3, A = 1, B = 2, X = 3, Y = 4
1, 2 and 3 are divisible by A.
2 is the only number in the given range which is divisible by B.
2 is divisible by both A and B.
1 and 3 can be divided by A to get the profit of 2 * 3 = 6
2 can be divided by B to get the profit of 1 * 4 = 4
2 is divisible by both but in order to maximise the profit it is divided by B instead of A.
Input: N = 6, A = 6, B = 2, X = 8, Y = 2
Approach: Easy to see that we can divide a number with both A and B only if the number is a multiple of lcm(A, B). Obviously, that number should be divided with the number that gives more profit.
So the answer equals to X * (N / A) + Y * (N / B) – min(X, Y) * (N / lcm(A, B)).
Below is the implementation of the above approach:
- Maximize the total profit of all the persons
- Maximize the summation of numbers in a maximum of K moves in range [L, R]
- Check divisibility by 7
- Divisibility by 12 for a large number
- Repeated Unit Divisibility
- Sub-string Divisibility by 11 Queries
- Sub-string Divisibility by 3 Queries
- Check divisibility in a binary stream
- Check if a large number is divisibility by 15
- To check divisibility of any large number by 999
- Divisibility by 64 with removal of bits allowed
- Divisibility by 3 where each digit is the sum of all prefix digits modulo 10
- Maximum path sum for each position with jumps under divisibility condition
- Program to calculate Profit Or Loss
- Program to calculate the profit sharing ratio
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.