Change

LinearList/Stack/appliance/StarRail.cpp

@@ -0,0 +1,7 @@
+#include <iostream>
+#include <stack>
+using namespace std;
+int main(){
+	
+	return 0;
+} 

LinearList/Stack/appliance/braket-match.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <stdexcept>
+#include <string>
+#include <stack>
+using namespace std;
+
+void isMatch(const string& s){
+	stack<int> t;
+	//bool error = false;
+	for(int i = 0; i < s.length(); i++){
+		if(s[i] == '('){
+			t.push(i);
+		}
+		if(s[i] == ')'){
+			try{
+				if(t.empty()) throw std::runtime_error("Error: Braket \" ) \" No Match");
+				t.pop();
+			}
+			catch(const runtime_error& e){
+				cout << e.what() << endl;
+				//error = true;
+				return;
+			}
+		}
+	}
+	if(t.empty())	cout << "Match" << endl;
+	else cout << "Error: Braket \" ( \" No Match" << endl;
+}
+
+int main(){
+	string s;
+	cin >> s;
+	isMatch(s);
+	return 0;
+}

LinearList/Stack/appliance/hanoi.cpp

@@ -0,0 +1,92 @@
+#include <iostream>
+#include <stack>
+using namespace std;
+
+void hanoi(int n, int a, int b, int c){
+	if(n == 1){
+		cout << "Move 1 from stack " << a << " to " << b << "(n == 1)" << endl;
+	} 
+	if(n > 1){
+		hanoi(n - 1, a, b, c);
+		cout << "Move " << n << " from stack " << a << " to " << c << endl;
+		hanoi(n - 1, b, c, a);
+	}
+}
+
+int main(){
+	hanoi(1, 1, 2, 3);
+	cout << endl;
+	hanoi(2, 1, 2, 3);
+	cout << endl;
+	hanoi(3, 1, 2, 3);
+	cout << endl;
+	hanoi(4, 1, 2, 3);
+	cout << endl;
+	hanoi(5, 1, 2, 3);
+	cout << endl;
+	return 0;
+} 
+
+/*
+Move 1 from stack 1 to 2(n == 1)
+
+Move 1 from stack 1 to 2(n == 1)
+Move 2 from stack 1 to 3
+Move 1 from stack 2 to 3(n == 1)
+
+Move 1 from stack 1 to 2(n == 1)
+Move 2 from stack 1 to 3
+Move 1 from stack 2 to 3(n == 1)
+Move 3 from stack 1 to 3
+Move 1 from stack 2 to 3(n == 1)
+Move 2 from stack 2 to 1
+Move 1 from stack 3 to 1(n == 1)
+
+Move 1 from stack 1 to 2(n == 1)
+Move 2 from stack 1 to 3
+Move 1 from stack 2 to 3(n == 1)
+Move 3 from stack 1 to 3
+Move 1 from stack 2 to 3(n == 1)
+Move 2 from stack 2 to 1
+Move 1 from stack 3 to 1(n == 1)
+Move 4 from stack 1 to 3
+Move 1 from stack 2 to 3(n == 1)
+Move 2 from stack 2 to 1
+Move 1 from stack 3 to 1(n == 1)
+Move 3 from stack 2 to 1
+Move 1 from stack 3 to 1(n == 1)
+Move 2 from stack 3 to 2
+Move 1 from stack 1 to 2(n == 1)
+
+Move 1 from stack 1 to 2(n == 1)
+Move 2 from stack 1 to 3
+Move 1 from stack 2 to 3(n == 1)
+Move 3 from stack 1 to 3
+Move 1 from stack 2 to 3(n == 1)
+Move 2 from stack 2 to 1
+Move 1 from stack 3 to 1(n == 1)
+Move 4 from stack 1 to 3
+Move 1 from stack 2 to 3(n == 1)
+Move 2 from stack 2 to 1
+Move 1 from stack 3 to 1(n == 1)
+Move 3 from stack 2 to 1
+Move 1 from stack 3 to 1(n == 1)
+Move 2 from stack 3 to 2
+Move 1 from stack 1 to 2(n == 1)
+Move 5 from stack 1 to 3
+Move 1 from stack 2 to 3(n == 1)
+Move 2 from stack 2 to 1
+Move 1 from stack 3 to 1(n == 1)
+Move 3 from stack 2 to 1
+Move 1 from stack 3 to 1(n == 1)
+Move 2 from stack 3 to 2
+Move 1 from stack 1 to 2(n == 1)
+Move 4 from stack 2 to 1
+Move 1 from stack 3 to 1(n == 1)
+Move 2 from stack 3 to 2
+Move 1 from stack 1 to 2(n == 1)
+Move 3 from stack 3 to 2
+Move 1 from stack 1 to 2(n == 1)
+Move 2 from stack 1 to 3
+Move 1 from stack 2 to 3(n == 1)
+*/