From 3a89fc707253f75f46fd5a4822817f1fd5156c40 Mon Sep 17 00:00:00 2001
From: Omar Magdy <omar.professional8777@gmail.com>
Date: Mon, 30 May 2022 00:18:17 +0200
Subject: Made that every problem is its own folder to make building the code a
 smooth operation with a shortcut

---
 recursionTest/recursionTest.cpp | 51 +++++++++++++++++++++++++++++++++++++++++
 1 file changed, 51 insertions(+)
 create mode 100644 recursionTest/recursionTest.cpp

(limited to 'recursionTest')

diff --git a/recursionTest/recursionTest.cpp b/recursionTest/recursionTest.cpp
new file mode 100644
index 0000000..91e9db8
--- /dev/null
+++ b/recursionTest/recursionTest.cpp
@@ -0,0 +1,51 @@
+#include <algorithm>
+#include<bits/stdc++.h>
+
+using namespace std;
+
+string ans;
+
+bool solve(vector<int> v,int idx, int target, int sum, string opts) {
+  if(idx == v.size() - 1) {
+    if(sum  == target){
+      ans = opts;
+      return true;
+    }
+    return false;
+  }
+  else {
+    int nxt = idx + 1;
+    bool plus = solve(v, nxt, target, sum + v[nxt],opts + "+");
+    bool minus = solve(v, nxt, target, sum - v[nxt], opts + "-");
+    bool mult = solve(v, nxt, target, sum * v[nxt], opts + "*");
+    bool div = solve(v, nxt, target, sum / v[nxt], opts + "/");
+    return plus || minus || mult || div;
+  }
+  
+}
+
+int main() {
+  int n, target;
+  cin >> n >> target;
+  vector<int> v(n);
+  string opts = "";
+  for(int &x : v) {
+    cin >> x;
+  }
+  sort(v.begin(), v.end());
+  do {
+    if(solve(v, 0, target, v[0], opts)) {
+      for(int i = 0; i < v.size(); i++) {
+        if (i == v.size() - 1) {
+          cout << v[i];
+        }
+        else {
+          cout << v[i] << " " << ans[i] << " ";
+        }
+      }
+      cout << '\n';
+    }
+  } while(next_permutation(v.begin(), v.end())); 
+
+  return 0;
+}
-- 
cgit v1.2.3