1-masala #include using namespace std; int main { long long a,b; cin>>a>>b; cout

92-masala
#include

using namespace std;

int main(){

int t,n,d;

cin>>t;
while(t--){
int ans=0;
cin>>n;
vectora;
for(int i=0;icin>>d;
a.push_back(d);
}
sort(a.begin(),a.end());

for(int o = 0; o < n; o++){

if( a[o] == a[o + 1]){
ans = ans + 1;
if(a[o] == a[o+2]){
o = o + 1;
}
}
}
cout<}
return 0;
}

93-masala
#include
using namespace std;
int fff(string s)
{
int a[26];
for (int i=0; i<26; i++) a[i]=0;
for (int i=0; i{
switch (s[i])
{
case 'a': a[0]++; break;
case 'b': a[1]++; break;
case 'c': a[2]++; break;
case 'd': a[3]++; break;
case 'e': a[4]++; break;
case 'f': a[5]++; break;
case 'g': a[6]++; break;
case 'h': a[7]++; break;
case 'i': a[8]++; break;
case 'j': a[9]++; break;
case 'k': a[10]++; break;
case 'l': a[11]++; break;
case 'm': a[12]++; break;
case 'n': a[13]++; break;
case 'o': a[14]++; break;
case 'p': a[15]++; break;
case 'q': a[16]++; break;
case 'r': a[17]++; break;
case 's': a[18]++; break;
case 't': a[19]++; break;
case 'u': a[20]++; break;
case 'v': a[21]++; break;
case 'w': a[22]++; break;
case 'x': a[23]++; break;
case 'y': a[24]++; break;
case 'z': a[25]++; break;
}
}
int k=0;
for (int i=0; i<26; i++)
{
if (a[i]>0) k=k+a[i]-1;
}
return k;
}
int main()
{
int n;
cin>>n;
int a[n];
string s;
for (int i=0; i<=n; i++)
{
getline(cin,s);
a[i]=fff(s);
}
for (int i=1; i<=n; i++)
{
cout<}
return 0;
}