Help me in solving ZXC problem

help
,
1

My issue

include <bits/stdc++.h>
typedef long long ll;
using namespace std;

int main() {
int t;
cin >> t;
while (t–)
{
ll n;
cin>>n;
string s;
cin>>s;
ll ans=((n-2)*(n-1))/2;
ll k=0;
for(int i=0;i<n-1;i++)
{
if(s[i]==s[i+1])
{
k++;
}

   }
   k=(k*(k-1))/2;
   cout<<ans-k<<endl;
}
return 0;

}

My code

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

int main() {
    int t;
    cin >> t;
    while (t--)
    {
       ll n;
       cin>>n;
       string s;
       cin>>s;
       ll ans=((n-2)*(n-1))/2;
       ll k=0;
       for(int i=0;i<n-1;i++)
       {
           if(s[i]==s[i+1])
           {
              k++;
           }
           
       }
       k=(k*(k-1))/2;
       cout<<ans-k<<endl;
    }
    return 0;



}

Problem Link: Chef Loves Beautiful Strings (Easy Version) Practice Coding Problem