LightOJ LOJ-1015 Brush (I) Solution

Problem Link: https://lightoj.com/problem/brush-1

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,t,i,j,a,s;

    cin>>t;

   for(i=1;i<=t;i++)

   {

       s=0;

       cin>>n;

       for(j=1;j<=n;j++)

       {

           cin>>a;

           if(a>0)

            s+=a;

       }

       printf("Case %d: %d\n",i,s);

   }

   return 0;

}