Codeforces Round #650 (Div. 3) 1367C - Social Distance Solution


 

Problem Link: https://codeforces.com/problemset/problem/1367/C

Solve in C++:  

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t,i,cn,n,m,k;
    cin>>t;
    while(t--)
    {
        cn=0;
        cin>>n>>k;
        string s;
        cin>>s;
        int z=0;
        z=k;
        for(i=0; i<n; i++)
        {

            if(s[i]=='0')
            {
                z++;
                if(z==k+1)
                {
                    cn++;
                    z=0;
                }
            }
            else
            {
                if(z<k)
                    cn--;
                z=0;
            }
        }
        cout<<cn<<endl;
    }
}

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.