-
Notifications
You must be signed in to change notification settings - Fork 57
/
2019PGCACA31
85 lines (77 loc) · 1.31 KB
/
2019PGCACA31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#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";
}
}