fork download
  1. #include <iostream>
  2. #include <stdio.h>
  3. #include <math.h>
  4. #include <string.h>
  5. #include <time.h>
  6. #include <stdlib.h>
  7. #include <string>
  8. #include <bitset>
  9. #include <vector>
  10. #include <set>
  11. #include <map>
  12. #include <queue>
  13. #include <algorithm>
  14. #include <sstream>
  15. #include <stack>
  16. #include <iomanip>
  17. using namespace std;
  18. #define pb push_back
  19. #define mp make_pair
  20. typedef pair<int,int> pii;
  21. typedef long long ll;
  22. typedef double ld;
  23. typedef vector<int> vi;
  24. #define fi first
  25. #define se second
  26. #define fe first
  27. #define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
  28. #define Edg int M=0,fst[SZ],vb[SZ],nxt[SZ];void ad_de(int a,int b){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;}void adde(int a,int b){ad_de(a,b);ad_de(b,a);}
  29. #define Edgc int M=0,fst[SZ],vb[SZ],nxt[SZ],vc[SZ];void ad_de(int a,int b,int c){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;vc[M]=c;}void adde(int a,int b,int c){ad_de(a,b,c);ad_de(b,a,c);}
  30. #define es(x,e) (int e=fst[x];e;e=nxt[e])
  31. #define esb(x,e,b) (int e=fst[x],b=vb[e];e;e=nxt[e],b=vb[e])
  32. #define SZ 1234567
  33. int T,n; char s[SZ],x[2];
  34. ll f(ll x) {return x*(x+1)/2;}
  35. void sol()
  36. {
  37. scanf("%d",&n);
  38. scanf("%s%s",s+1,x);
  39. int l=0; ll ans=0;
  40. for(int i=1;i<=n;++i)
  41. if(s[i]==x[0]) ans+=f(l),l=0;
  42. else ++l;
  43. ans+=f(l);
  44. ans=f(n)-ans;
  45. printf("%lld\n",ans);
  46. }
  47. int main()
  48. {
  49. scanf("%d",&T);
  50. while(T--) sol();
  51. }
Success #stdin #stdout 0s 16440KB
stdin
Standard input is empty
stdout
Standard output is empty