5 files changed, 118 insertions, 15 deletions
diff --git a/codeforces/MakeItUgly/main.cpp b/codeforces/MakeItUgly/main.cpp
new file mode 100755
index 0000000..22b800e
--- /dev/null
+++ b/codeforces/MakeItUgly/main.cpp
@@ -0,0 +1,90 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = 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};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* 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;
+  vi v(n);
+  for (auto &x : v) {
+    cin >> x;
+  }
+  int cnt_front = 0;
+  int cnt_back = 0;
+  for (int i = 0; i < n - 1; i++) {
+    dbg(v[i + 1], v[i]);
+    if (v[i + 1] == v[i]) {
+      cnt_front++;
+    } else {
+      break;
+    }
+  }
+  for (int i = n - 1; i >= 0; i--) {
+    if (v[i - 1] == v[i]) {
+      cnt_back++;
+    } else {
+      break;
+    }
+  }
+  if (cnt_front == n - 1 && cnt_back == n - 1) {
+    cout << -1 << '\n';
+    return;
+  }
+
+  if (cnt_front == 0 || cnt_back == 0) {
+    cout << 0 << '\n';
+    return;
+  }
+  cnt_front++;
+  cnt_back++;
+  cout << min(cnt_front, cnt_back) << '\n';
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/codeforces/MakeItUgly/main_input0.txt b/codeforces/MakeItUgly/main_input0.txt
new file mode 100644
index 0000000..72233ee
--- /dev/null
+++ b/codeforces/MakeItUgly/main_input0.txt
@@ -0,0 +1,9 @@
+4
+3
+2 2 2
+5
+1 2 1 2 1
+1
+1
+7
+3 3 3 5 3 3 3
diff --git a/codeforces/MakeItUgly/main_output0.txt b/codeforces/MakeItUgly/main_output0.txt
new file mode 100644
index 0000000..97ef938
--- /dev/null
+++ b/codeforces/MakeItUgly/main_output0.txt
@@ -0,0 +1,4 @@
+-1
+1
+-1
+3
diff --git a/codeforces/TechnicalSupport/main.cpp b/codeforces/TechnicalSupport/main.cpp
index 57e8dd3..c9ee12d 100755
--- a/codeforces/TechnicalSupport/main.cpp
+++ b/codeforces/TechnicalSupport/main.cpp
@@ -1,4 +1,4 @@
-#include<bits/stdc++.h>
+#include <bits/stdc++.h>
 
 using namespace std;
 
@@ -38,14 +38,14 @@ void solve() {
   cout << (cnt == 0 ? "Yes" : "No") << '\n';
 }
 
-int main () {
-	ios_base::sync_with_stdio(false);
-	cin.tie(NULL);
-	int tt;
-	cin >> tt;
-	while(tt--) {
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
     solve();
-	}
+  }
 }
 
 /* stuff you should look for:
diff --git a/codeforces/UltraFastMathmatician/main.cpp b/codeforces/UltraFastMathmatician/main.cpp
index 83ef653..b096db4 100755
--- a/codeforces/UltraFastMathmatician/main.cpp
+++ b/codeforces/UltraFastMathmatician/main.cpp
@@ -1,15 +1,15 @@
-#include<bits/stdc++.h>
+#include <bits/stdc++.h>
 
 using namespace std;
 
-int main () {
-	ios_base::sync_with_stdio(false);
-	cin.tie(NULL);
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
   string s1, s2;
   cin >> s1 >> s2;
-  string ans="";
-  for(int i = 0; i < s1.size(); i++) {
-    ans+=((s1[i] - '0') ^ (s2[i] - '0') + '0');
+  string ans = "";
+  for (int i = 0; i < s1.size(); i++) {
+    ans += ((s1[i] - '0') ^ (s2[i] - '0') + '0');
   }
   cout << ans << endl;
 }