Codeforces Round #807 (Div. 2) 1705B - Mark the Dust Sweeper Solution

 Problem Link: https://codeforces.com/contest/1705/problem/B

Solution 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()

{

    long long  f,x,t,i,n,ans;

    cin>>t;

    while(t--)

    {

        f=ans=0;

        cin>>n;

        for(i=0; i<n; i++)

        {

            cin>>x;

            if(i+1<n)

            {

                if(x!=0)f=1;

                else

                ans+=f;

                ans+=x;

            }

        }

        cout<<ans<<endl;

    }

}