23March

Author: vijaypurohit

Recursion/GFG_JosephusProblem.cpp

@@ -0,0 +1,42 @@
+/*
+https://practice.geeksforgeeks.org/problems/josephus-problem/1
+Josephus problem 
+*/
+// { Driver Code Starts
+#include <bits/stdc++.h>
+using namespace std;
+
+
+
+ // } Driver Code Ends
+/*You are required to complete this method */
+
+class Solution
+{
+    public:
+    int josephus(int n, int k)
+    {
+      if(n==1) return 1;
+      return (josephus(n-1,k) + k-1)%n+1;
+    }
+};
+
+
+
+// { Driver Code Starts.
+
+int main() {
+	
+	int t;
+	cin>>t;//testcases
+	while(t--)
+	{
+		int n,k;
+		cin>>n>>k;//taking input n and k
+		
+		//calling josephus() function
+		Solution ob;
+		cout<<ob.josephus(n,k)<<endl;
+	}
+	return 0;
+}  // } Driver Code Ends

Recursion/GFG_TowerOfHanoi.cpp

@@ -0,0 +1,58 @@
+/*
+https://practice.geeksforgeeks.org/problems/tower-of-hanoi-1587115621/1#
+Tower Of Hanoi 
+*/
+// { Driver Code Starts
+#include <bits/stdc++.h>
+
+using namespace std;
+
+
+ // } Driver Code Ends
+class Solution{
+    public:
+    // You need to complete this function
+
+    long long steps=0;
+    // avoid space at the starting of the string in "move disk....."
+    long long toh(int N, int from, int to, int aux) {
+     steps++;
+     if(N==1) 
+     {
+         cout<<"move disk "<<N<<" from rod "<<from<<" to rod "<<to<<endl;
+         return 1;
+     }
+     
+     
+     toh(N-1, from, aux, to);
+        cout<<"move disk "<<N<<" from rod "<<from<<" to rod "<<to<<endl;
+     toh(N-1, aux, to, from);
+     
+        
+     return steps;
+    //  return pow(2,N)-1;
+    }
+
+};
+
+// { Driver Code Starts.
+
+int main() {
+
+    int T;
+    cin >> T;//testcases
+    while (T--) {
+        
+        int N;
+        cin >> N;//taking input N
+        
+        //calling toh() function
+        Solution ob;
+        
+        cout << ob.toh(N, 1, 3, 2) << endl;
+    }
+    return 0;
+}
+
+
+//Position this line where user code will be pasted.  // } Driver Code Ends