LightOJ 1387 Setu Solution



 Problem Link:  https://lightoj.com/problem/setu

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,sum,a;
    cin>>t;
    for(i=1; i<=t; i++)
    {
        cout << "Case " << i << ":\n";
        cin>>n;
        sum=0;
        string s;
        for(j=0; j<n; j++)
        {
            cin>>s;
            if(s=="donate")
            {
                cin>>a;
                sum+=a;
            }
            else
            cout<<sum<<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.