Problem Description

You are given a string S consisting of lowercase letters, and your task is counting the number of substring that the number of each lowercase letter in the substring is no more than K.

 

Input

In the first line there is an integer T , indicates the number of test cases. For each case, the first line contains a string which only consist of lowercase letters. The second line contains an integer K.
[Technical Specification] 1<=T<= 100 1 <= the length of S <= 100000 1 <= K <= 100000

 

Output

For each case, output a line contains the answer.

 

Sample Input

 

Sample Output

 

Source

 

Recommend

heyang   |   We have carefully selected several similar problems for you:  5057 5055 5054 5053 5052 

 #include<iostream>

 #include<cstring>

 #include<cstdlib>

 #include<cstdio>

 #include<algorithm>

 #include<cmath>

 #include<queue>

 #include<map>

 #include<string>

 #define N 100005

 #define M 15

 #define mod 10000007

 //#define p 10000007

 #define mod2 100000000

 #define ll long long

 #define LL long long

 #define maxi(a,b) (a)>(b)? (a) : (b)

 #define mini(a,b) (a)<(b)? (a) : (b)

 using namespace std;

 int T;

 int n;

 ll l;

 char s[N];

 ll ans;

 ll vis[];

 ll k;

 ll te;

 void ini()

 {

     ans=;

     scanf("%s",s);

     scanf("%I64d",&k);

     l=strlen(s);

     memset(vis,,sizeof(vis));

 }

 void solve()

 {

     ll i;

     ll pre;

     pre=;

     for(i=;i<l;i++){

         vis[ s[i]-'a' ]++;

         while(vis[ s[i]-'a' ]>k){

             vis[ s[pre]-'a' ]--;

             pre++;

         }

         ans+=i-pre+;

     }

 }

 void out()

 {

     printf("%I64d\n",ans);

 }

 int main()

 {

     //freopen("data.in","r",stdin);

     //freopen("data.out","w",stdout);

     scanf("%d",&T);

    // for(int ccnt=1;ccnt<=T;ccnt++)

     while(T--)

    // while(scanf("%d",&n)!=EOF)

     {

       //  if(n==0 && m==0) break;

         //printf("Case %d: ",ccnt);

         ini();

         solve();

         out();

     }

     return ;

 }