fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29. void solve(string s, unordered_set<string>& st){
  30.  
  31. if(s == "") return;
  32. if(s.size() == 1){
  33. st.insert(s);
  34. return;
  35. }
  36. if(st.count(s)) return;
  37.  
  38. st.insert(s);
  39.  
  40. solve(s.substr(1) , st);
  41. solve( s.substr(0, 1) + s.substr(2) , st);
  42. }
  43.  
  44. int consistency(int n, string s){
  45.  
  46. unordered_set<string> st;
  47.  
  48. solve(s, st);
  49.  
  50. return st.size();
  51. }
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67. int practice(int n){
  68.  
  69.  
  70. return 0;
  71. }
  72.  
  73.  
  74.  
  75.  
  76.  
  77. void solve() {
  78.  
  79. int n;
  80. cin>> n;
  81.  
  82. string s;
  83. cin >> s;
  84.  
  85. cout << consistency(n, s) << endl;
  86.  
  87.  
  88. }
  89.  
  90.  
  91.  
  92.  
  93.  
  94. int32_t main() {
  95. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  96.  
  97. int t = 1;
  98. cin >> t;
  99. while (t--) {
  100. solve();
  101. }
  102.  
  103. return 0;
  104. }
Success #stdin #stdout 0s 5312KB
stdin
5
5
aaaaa
1
z
5
ababa
14
bcdaaaabcdaaaa
20
abcdefghijklmnopqrst
stdout
5
1
9
50
210