aboutsummaryrefslogtreecommitdiff
path: root/contests/Starters78/B/main.cpp
diff options
context:
space:
mode:
authoromagdy7 <omar.professional8777@gmail.com>2023-02-22 20:18:04 +0200
committeromagdy7 <omar.professional8777@gmail.com>2023-02-22 20:18:04 +0200
commitef9dfb5d8bfa705a0c056a2652d298e5ebb763fb (patch)
treea3ae50170dcaa0982a2680fb9df2c1a8ec179bb4 /contests/Starters78/B/main.cpp
parent6fd4c8747f798b62428ca020171596b8636a7a4c (diff)
downloadcompetitive-programming-ef9dfb5d8bfa705a0c056a2652d298e5ebb763fb.tar.xz
competitive-programming-ef9dfb5d8bfa705a0c056a2652d298e5ebb763fb.zip
Solved a bunch of problems
Diffstat (limited to 'contests/Starters78/B/main.cpp')
-rwxr-xr-xcontests/Starters78/B/main.cpp109
1 files changed, 109 insertions, 0 deletions
diff --git a/contests/Starters78/B/main.cpp b/contests/Starters78/B/main.cpp
new file mode 100755
index 0000000..d5c6cce
--- /dev/null
+++ b/contests/Starters78/B/main.cpp
@@ -0,0 +1,109 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+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
+
+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};
+
+// pretty printing
+template <typename K, typename V> void printm(const map<K, V> &mp) {
+ cerr << "{" << endl;
+ for (auto p : mp) {
+ cerr << " { " << p.first << " : " << p.second << " }\n";
+ }
+ cerr << "}" << endl;
+}
+template <typename T> void printv(const vector<T> &v) {
+ cerr << "[";
+ for (int i = 0; i < v.size(); i++) {
+ if (i == v.size() - 1) {
+ cerr << v[i];
+ } else {
+ cerr << v[i] << ", ";
+ }
+ }
+ cerr << "]\n";
+}
+
+template <typename T> void printvv(const vector<vector<T>> &v) {
+ cerr << "[\n";
+ for (auto &vec : v) {
+ cout << " ";
+ printv(vec);
+ }
+ cerr << "]\n";
+}
+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 n, x;
+ cin >> n >> x;
+ if ((x < 0 && n - abs(x) < 1) || (x > 0 && n + 1 < x)) {
+ cout << "-1\n";
+ return;
+ }
+ if (x == 0) {
+ for (int i = 0; i < n - 1; i++) {
+ cout << "*";
+ }
+ cout << "-\n";
+ return;
+ }
+ if (x > 0) {
+ for (int i = 0; i < n - abs(x) + 1; i++) {
+ cout << "*";
+ }
+ for (int i = 0; i < abs(x) - 1; i++) {
+ cout << "+";
+ }
+ } else {
+ for (int i = 0; i < n - abs(x) - 1; i++) {
+ cout << "*";
+ }
+ for (int i = 0; i < abs(x) + 1; i++) {
+ cout << "-";
+ }
+
+ }
+ cout << '\n';
+}
+
+int main() {
+ ios_base::sync_with_stdio(false);
+ cin.tie(NULL);
+ int tt;
+ cin >> tt;
+ while (tt--) {
+ solve();
+ }
+}