aboutsummaryrefslogtreecommitdiff
path: root/chocolateFeastRevised
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
commit3a89fc707253f75f46fd5a4822817f1fd5156c40 (patch)
tree474b08b187895af91c10838aae21142b2ba2514d /chocolateFeastRevised
parentf5ff62a26052f084b6b807cba220c86785fd45e3 (diff)
downloadcompetitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.tar.xz
competitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.zip
Made that every problem is its own folder to make building the code a smooth operation with a shortcut
Diffstat (limited to 'chocolateFeastRevised')
-rw-r--r--chocolateFeastRevised/chocolateFeastRevised.cpp19
1 files changed, 19 insertions, 0 deletions
diff --git a/chocolateFeastRevised/chocolateFeastRevised.cpp b/chocolateFeastRevised/chocolateFeastRevised.cpp
new file mode 100644
index 0000000..edaa983
--- /dev/null
+++ b/chocolateFeastRevised/chocolateFeastRevised.cpp
@@ -0,0 +1,19 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+ int tt;
+ cin >> tt;
+ while (tt--) {
+ int n, c, m;
+ cin >> n >> c >> m;
+ long long ans = n / c, cur = ans;
+ while (cur >= m) {
+ ans += cur / m;
+ cur = (cur % m) + (cur / m);
+ }
+ cout << ans << '\n';
+ }
+ return 0;
+}