Codeforces Round #779 (Div. 2) 1658B. Marin and Anti-coprime Permutation Solution

 Problem Link :  https://codeforces.com/contest/1658/problem/A

Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    long long n,x,y,test,k;

    cin>>test;

    for(int k=1; k<=test; k++)

    {

        cin>>n;

        string ss;

        cin>>ss;

        int cn=0,ln;

        ln=ss.size();

        for(int j=0; j<ln-1; j++)

        {

            if(ss[j+1]=='0' && ss[j]=='0')

                cn+=2;

            else if(ss[j+2]=='0' && ss[j]=='0')

                cn++;

        }

        cout<<cn<<endl;

    }

}