Number of Ways to Buy Pens and Pencils LeetCode solution in C++

1
class Solution {
2
public:
3
long long waysToBuyPensPencils(int total, int cost1, int cost2) {
4
long long ways = 0;
5
long long penscost = 0;
6
while (penscost <= total) {
7
long long remainingAmount = total - penscost;
8
long long pencils = remainingAmount / cost2 + 1;
9
ways += pencils;
10
penscost += cost1;
11
}
12
return ways;
13
}
14
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0