aboutsummaryrefslogtreecommitdiff
path: root/codeforces/YetAnotherPromotion
diff options
context:
space:
mode:
Diffstat (limited to 'codeforces/YetAnotherPromotion')
-rwxr-xr-xcodeforces/YetAnotherPromotion/mainbin0 -> 17832 bytes
-rwxr-xr-xcodeforces/YetAnotherPromotion/main.cpp142
-rw-r--r--codeforces/YetAnotherPromotion/main_input0.txt11
-rw-r--r--codeforces/YetAnotherPromotion/main_output0.txt5
4 files changed, 158 insertions, 0 deletions
diff --git a/codeforces/YetAnotherPromotion/main b/codeforces/YetAnotherPromotion/main
new file mode 100755
index 0000000..798f6a8
--- /dev/null
+++ b/codeforces/YetAnotherPromotion/main
Binary files differ
diff --git a/codeforces/YetAnotherPromotion/main.cpp b/codeforces/YetAnotherPromotion/main.cpp
new file mode 100755
index 0000000..1bb5eb9
--- /dev/null
+++ b/codeforces/YetAnotherPromotion/main.cpp
@@ -0,0 +1,142 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpi = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b) - 1) / (b))
+
+const int MOD = (int)1e9 + 7;
+const db PI = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p);
+template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec);
+template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m);
+template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m);
+template<typename T> ostream& operator<<(ostream& os, const set<T>& s);
+template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s);
+
+template<typename K, typename V>
+ostream& operator<<(ostream& os, const pair<K, V>& p) {
+ os << "(" << p.first << ", " << p.second << ")";
+ return os;
+}
+
+template<typename T>
+ostream& operator<<(ostream& os, const vector<T>& vec) {
+ os << "{";
+ for (size_t i = 0; i < vec.size(); ++i) {
+ if (i > 0) os << ", ";
+ os << vec[i];
+ }
+ os << "}";
+ return os;
+}
+
+
+template<typename K, typename V>
+ostream& operator<<(ostream& os, const map<K, V>& m) {
+ os << "{";
+ for (const auto& p : m) {
+ os << p.first << ": " << p.second << ", ";
+ }
+ os << "}";
+ return os;
+}
+
+template<typename K, typename V>
+ostream& operator<<(ostream& os, const unordered_map<K, V>& m) {
+ os << "{";
+ for (const auto& p : m) {
+ os << p.first << ": " << p.second << ", ";
+ }
+ os << "}";
+ return os;
+}
+
+template<typename T>
+ostream& operator<<(ostream& os, const set<T>& s) {
+ int i = 0;
+ os << "{";
+ for (const auto& e : s) {
+ if (i > 0) os << ", ";
+ os << e;
+ i++;
+ }
+ os << "}";
+ return os;
+}
+
+template<typename T>
+ostream& operator<<(ostream& os, const unordered_set<T>& s) {
+ int i = 0;
+ os << "{";
+ for (const auto& e : s) {
+ if (i > 0) os << ", ";
+ os << e;
+ i++;
+ }
+ os << "}";
+ return os;
+}
+
+void print() {
+ cerr << "\n";
+}
+
+template<typename T, typename... TS>
+void print(T val, TS... vals) {
+ cerr << val << " ";
+ print(vals...);
+}
+
+
+
+/* stuff you should look for:
+ ---------------------------
+ * special cases (n=1?)
+ * int overflow, array bounds
+ * do smth instead of nothing and stay organized
+ * WRITE STUFF DOWN
+ * DON'T GET STUCK ON ONE APPROACH
+ */
+
+void solve() {
+ int a, b;
+ cin >> a >> b;
+ int n, m;
+ cin >> n >> m;
+ ll ans = 0;
+ ll tmp = (a / (m + 1));
+ ans += a * tmp;
+ n -= tmp + (tmp / m);
+ print(tmp);
+ ans += min(a * n, b * n);
+ cout << ans << '\n';
+}
+
+int main () {
+ ios_base::sync_with_stdio(false);
+ cin.tie(NULL);
+ int tt;
+ cin >> tt;
+ while(tt--) {
+ solve();
+ }
+}
+
+
diff --git a/codeforces/YetAnotherPromotion/main_input0.txt b/codeforces/YetAnotherPromotion/main_input0.txt
new file mode 100644
index 0000000..385279a
--- /dev/null
+++ b/codeforces/YetAnotherPromotion/main_input0.txt
@@ -0,0 +1,11 @@
+5
+5 4
+3 1
+5 4
+3 2
+3 4
+3 5
+20 15
+10 2
+1000000000 900000000
+1000000000 8
diff --git a/codeforces/YetAnotherPromotion/main_output0.txt b/codeforces/YetAnotherPromotion/main_output0.txt
new file mode 100644
index 0000000..5aeb0c1
--- /dev/null
+++ b/codeforces/YetAnotherPromotion/main_output0.txt
@@ -0,0 +1,5 @@
+9
+10
+9
+135
+888888888900000000