From 65cbc4732866264a930f30d948f7258f6dde7497 Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Mon, 14 Nov 2022 12:16:09 +0200 Subject: Added new problems --- codeforces/DiverseSubStrings/main | Bin 0 -> 44672 bytes codeforces/DiverseSubStrings/main.cpp | 66 ++++++++++++++++++++++++++ codeforces/DiverseSubStrings/main_input0.txt | 15 ++++++ codeforces/DiverseSubStrings/main_output0.txt | 7 +++ 4 files changed, 88 insertions(+) create mode 100755 codeforces/DiverseSubStrings/main create mode 100644 codeforces/DiverseSubStrings/main.cpp create mode 100644 codeforces/DiverseSubStrings/main_input0.txt create mode 100644 codeforces/DiverseSubStrings/main_output0.txt (limited to 'codeforces/DiverseSubStrings') diff --git a/codeforces/DiverseSubStrings/main b/codeforces/DiverseSubStrings/main new file mode 100755 index 0000000..90f8e78 Binary files /dev/null and b/codeforces/DiverseSubStrings/main differ 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 + +using namespace std; + +using ll = long long; +using pi = pair; +using vpi = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +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 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 + */ diff --git a/codeforces/DiverseSubStrings/main_input0.txt b/codeforces/DiverseSubStrings/main_input0.txt new file mode 100644 index 0000000..0df0884 --- /dev/null +++ b/codeforces/DiverseSubStrings/main_input0.txt @@ -0,0 +1,15 @@ +7 +1 +7 +2 +77 +4 +1010 +5 +01100 +6 +399996 +5 +23456 +18 +789987887987998798 diff --git a/codeforces/DiverseSubStrings/main_output0.txt b/codeforces/DiverseSubStrings/main_output0.txt new file mode 100644 index 0000000..f5bd615 --- /dev/null +++ b/codeforces/DiverseSubStrings/main_output0.txt @@ -0,0 +1,7 @@ +1 +2 +10 +12 +10 +15 +106 -- cgit v1.2.3