6 files changed, 176 insertions, 0 deletions
diff --git a/contests/Round862/B/main b/contests/Round862/B/main
new file mode 100755
index 0000000..e47f442
--- /dev/null
+++ b/contests/Round862/B/main
diff --git a/contests/Round862/B/main.cpp b/contests/Round862/B/main.cpp
new file mode 100755
index 0000000..b256f22
--- /dev/null
+++ b/contests/Round862/B/main.cpp
@@ -0,0 +1,159 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpi = vector<pii>;
+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
+#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b) - 1) / (b))
+
+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};
+
+template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p);
+template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec);
+template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m);
+template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m);
+template<typename T> ostream& operator<<(ostream& os, const set<T>& s);
+template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s);
+
+template<typename K, typename V>
+ostream& operator<<(ostream& os, const pair<K, V>& p) {
+  os << "(" << p.first << ", " << p.second << ")";
+  return os;
+}
+
+template<typename T>
+ostream& operator<<(ostream& os, const vector<T>& vec) {
+  os << "{";
+  for (size_t i = 0; i < vec.size(); ++i) {
+    if (i > 0) os << ", ";
+    os << vec[i];
+  }
+  os << "}";
+  return os;
+}
+
+
+template<typename K, typename V>
+ostream& operator<<(ostream& os, const map<K, V>& m) {
+  os << "{";
+  for (const auto& p : m) {
+    os << p.first << ": " << p.second << ", ";
+  }
+  os << "}";
+  return os;
+}
+
+template<typename K, typename V>
+ostream& operator<<(ostream& os, const unordered_map<K, V>& m) {
+  os << "{";
+  for (const auto& p : m) {
+    os << p.first << ": " << p.second << ", ";
+  }
+  os << "}";
+  return os;
+}
+
+template<typename T>
+ostream& operator<<(ostream& os, const set<T>& s) {
+  int i = 0;
+  os << "{";
+  for (const auto& e : s) {
+    if (i > 0) os << ", ";
+    os << e;
+    i++;
+  }
+  os << "}";
+  return os;
+}
+
+template<typename T>
+ostream& operator<<(ostream& os, const unordered_set<T>& s) {
+  int i = 0;
+  os << "{";
+  for (const auto& e : s) {
+    if (i > 0) os << ", ";
+    os << e;
+    i++;
+  }
+  os << "}";
+  return os;
+}
+
+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;
+  cin >> n;
+  string s;
+  cin >> s;
+  map<char, int> mp;
+  string alphabet = "abcdefghijklmnopqrstuvwxyz";
+  for (int i = 0; i < n; i++) {
+    mp[s[i]] = i;
+  }
+  string ans = "";
+  int pos = find(all(alphabet), s[0]) - alphabet.begin();
+  for (int i = 0; i <= pos; i++) {
+    if (mp[alphabet[i]] != 0) {
+      ans += alphabet[i];
+      for (int j = 0; j < n; j++) {
+        if (j != mp[alphabet[i]]) {
+          ans += s[j];
+        }
+      }
+      break;
+    }
+  }
+  if (ans == "") {
+    cout << s << '\n';
+  } else {
+    cout << ans << '\n';
+  }
+
+}
+
+int main () {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while(tt--) {
+    solve();
+  }
+}
+
+
diff --git a/contests/Round862/B/main_input0.txt b/contests/Round862/B/main_input0.txt
new file mode 100644
index 0000000..8b27b3c
--- /dev/null
+++ b/contests/Round862/B/main_input0.txt
@@ -0,0 +1,9 @@
+4
+3
+cba
+4
+acac
+5
+abbcb
+4
+aaba
diff --git a/contests/Round862/B/main_input1.txt b/contests/Round862/B/main_input1.txt
new file mode 100644
index 0000000..260e893
--- /dev/null
+++ b/contests/Round862/B/main_input1.txt
@@ -0,0 +1,3 @@
+1
+6
+abbaab
+\ No newline at end of file
diff --git a/contests/Round862/B/main_output0.txt b/contests/Round862/B/main_output0.txt
new file mode 100644
index 0000000..d872337
--- /dev/null
+++ b/contests/Round862/B/main_output0.txt
@@ -0,0 +1,4 @@
+acb
+aacc
+abbcb
+aaab
diff --git a/contests/Round862/B/main_output1.txt b/contests/Round862/B/main_output1.txt
new file mode 100644
index 0000000..b3be43d
--- /dev/null
+++ b/contests/Round862/B/main_output1.txt
@@ -0,0 +1 @@
+aabbab
+\ No newline at end of file