Accepted solution

282A - Bit++.

Open original problem
Source code

#include <iostream>

#include<vector>

#include<string>

#include<math.h>

#include<set>

#include<map>

#include<algorithm>

/***** S. M. Sabiul Hajjaj Sabit *****/

using namespace std;

template <typename T>long long int power(T a, T b)

{

    long long int pow=1;

    for(int i=0; i<b; i++)

    {

        pow *= a;

    }

    return pow;

}

///*********Write Code From Here*********///

int main()

{

    int x=0;

    int n;

    cin>>n;

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

    {

        string s;

        cin>>s;

        if(s=="++X")++x;

        else if(s =="X++")x++;

        else if(s =="--X")--x;

        else x--;

    }

    cout<<x<<endl;

}
Join the discussion

Add your comment