2019PGCACA31

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
    int n,k;
    
    char num[100000];
    cin>>n>>k;
    cin>>num;
    int i=0;
    while(i<k&&i<n)
    {
        if(i==0&&num[i]=='1')
        k++;
        else if(i==0&&num[i]!='1')
        num[i]='1';
        else if(num[i]=='0')
        k++;
        else
        num[i]='0';
        i++;
    }
    cout<<num;
}
=======
#include<bits/stdc++.h>
using namespace std;

int main(){
    int n,k;
    cin>>n>>k;
    char a[n],b;
    int h[26]={0};
    cin>>a;
    while(k--)
    {
        cin>>b;
        h[b-97]++;
    }
    int count=0,sum=0;
    for(int i=0;i<n+1;i++)
    {
        if(h[a[i]-97]&&i<n)
        {
            count++;
        }
        else{
            sum+=count*(count+1)/2;
            count=0;
            
        }
    }
    cout<<sum;
}

int main()
{
    int t;
    cin>>t;
    int ar[3];
    while(t--){
    cin>>ar[0]>>ar[1]>>ar[2];
    sort(ar,ar+3);
    if(ar[0]==ar[1]&&ar[1]==ar[2])
    {
        cout<<0<<"\n";
        continue;
    }
    else if(ar[0]==ar[1]&&ar[2]>ar[1])
        {
            
            ar[2]=ar[2]-1;
        }   
        else{
            ar[0]=ar[0]+1;
            ar[2]=ar[2]-1;
        }
            int sum=abs(ar[0]-ar[1])+abs(ar[0]-ar[2])+abs(ar[1]-ar[2]);
            cout<<sum<<"\n";
        }
    }