From 65cbc4732866264a930f30d948f7258f6dde7497 Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Mon, 14 Nov 2022 12:16:09 +0200
Subject: Added new problems

---
 codeforces/DiverseSubStrings/main.cpp | 66 +++++++++++++++++++++++++++++++++++
 1 file changed, 66 insertions(+)
 create mode 100644 codeforces/DiverseSubStrings/main.cpp

(limited to 'codeforces/DiverseSubStrings/main.cpp')

diff --git a/codeforces/DiverseSubStrings/main.cpp b/codeforces/DiverseSubStrings/main.cpp
new file mode 100644
index 0000000..1e6fbf9
--- /dev/null
+++ b/codeforces/DiverseSubStrings/main.cpp
@@ -0,0 +1,66 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define push_back pb
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+
+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};
+
+void solve() {
+  int n;
+  cin >> n;
+  string s; cin >> s;
+  set<int> st;
+  vi v(11);
+  int cnt = 0;
+  for (int i = 0; i < n; i++) {
+    for (int j = i; j < i; j++) {
+      for (int k = j + 1; k < j - 1; k++) {
+        st.insert(s[k]);
+        v[s[k] - '0']++;
+        if(*max_element(all(v)) <= st.size()) {
+          cnt++;
+        }
+      }
+      st.clear();
+      v.clear();
+    }
+  }
+  cout << cnt << endl;
+
+}
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	int tt;
+	cin >> tt;
+	while(tt--) {
+    solve();
+	}
+}
+
+/* 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
+ */
-- 
cgit v1.2.3