diff --git a/15661.cpp b/15661.cpp
new file mode 100644
index 0000000..36d859b
--- /dev/null
+++ b/15661.cpp
@@ -0,0 +1,46 @@
+
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int permutation(vector<bool> num, int n, vector<vector<int>> stat){
+    int ans = 2000;
+
+    for(int i=0; i<n/2; i++){
+        num[i] = true;
+    }
+
+    do{
+        int l_total = 0, s_total = 0;
+        for(int i=0; i<n; i++){
+            for(int j=0; j<n; j++){
+                if(num[i] && num[j])
+                    l_total += stat[i][j];
+                else if(!num[i] && !num[j])
+                    s_total += stat[i][j];
+            }
+        }
+        ans = min(ans, abs(l_total-s_total));
+    }while(prev_permutation(num.begin(), num.end()));
+
+    return ans;
+}
+
+int main(){
+    int n;
+    cin >> n;
+    vector<vector<int>> stat(n, vector<int>(n, 0));
+    for(int i=0; i<n; i++){
+        for(int j=0; j<n; j++){
+            cin >> stat[i][j];
+        }
+    }
+
+    vector<bool> num(n, false);
+
+    cout << permutation(num, n, stat);
+
+    return 0;
+}
diff --git a/15665.cpp b/15665.cpp
new file mode 100644
index 0000000..c4e7251
--- /dev/null
+++ b/15665.cpp
@@ -0,0 +1,44 @@
+
+#include <iostream>
+#include <set>
+#include <vector>
+
+using namespace std;
+
+int n, m;
+vector<int> temp(7);
+set<vector<int>> out;
+
+void backtracking(int cnt, vector<int> nums){
+    if(cnt == m){
+        out.insert(temp);
+        return;
+    }
+
+    for(int i=0; i<n; i++){
+        temp[cnt] = nums[i];
+        backtracking(cnt+1, nums);
+    }
+}
+
+int main(){
+
+    cin >> n >> m;
+
+    vector<int> nums(n);
+    for(int i=0; i<n; i++){
+        cin >> nums[i];
+    }
+
+    backtracking(0, nums);
+
+    for(auto it=out.begin(); it != out.end(); it++){
+        vector<int> t = *it;
+        for(int j=0; j<m; j++){
+            cout << t[j] << ' ';
+        }
+        cout << '\n';
+    }
+
+    return 0;
+}
diff --git a/2529.cpp b/2529.cpp
new file mode 100644
index 0000000..ed3d511
--- /dev/null
+++ b/2529.cpp
@@ -0,0 +1,61 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int n;
+vector<char> gl;
+string s;
+vector<string> ans;
+bool check[10];
+int name[10];
+
+void backtracking(int cnt, int prev, char c){
+    if(cnt == n+1){
+        s = "";
+        for(int i=0; i<=n; i++){
+            s += to_string(name[i]);
+        }
+        ans.push_back(s);
+        return;
+    }
+
+    if(c == '<'){
+        for(int i=prev+1; i<10; i++){
+            if(!check[i]){
+                check[i] = true;
+                name[cnt] = i;
+                backtracking(cnt+1, i, gl[cnt]);
+                check[i] = false;
+            }
+        }
+    }
+    else if(c == '>'){
+        for(int i=0; i<prev; i++){
+            if(!check[i]){
+                check[i] = true;
+                name[cnt] = i;
+                backtracking(cnt+1, i, gl[cnt]);
+                check[i] = false;
+            }
+        }
+    }
+}
+
+int main(){
+
+    cin >> n;
+
+    for(int i=0; i<n; i++){
+        char ch;
+        cin >> ch;
+        gl.push_back(ch);
+    }
+
+    backtracking(0, -1, '<');
+    sort(ans.begin(), ans.end());
+
+    cout << ans.back() << '\n' << ans.front();
+
+}