Solution of 'Maps-STL' (Hackerrank)

So, here's my solution of the question- Maps-STL of Hackerrank. If you guys have any suggestions, do comment. Thank you and Happy coding.

link: https://www.hackerrank.com/challenges/cpp-maps/problem

#include <cstdio>
 #include <cmath>
#include <vector>
#include <iostream>
#include <set>
#include <map>
#include <algorithm>
using namespace std;


int main()
{
    int q;
    cin>>q;
    int a[q];
    map<string,int> mark;
    for(int i=0;i<q;i++){
        cin>>a[i];
        if(a[i]==1){
            string p;
            int k;
            cin>>p>>k;
            mark[p]+=k;
        }
        else if(a[i]==2){
            string p;
            cin>>p;
            mark[p]=0;
        }
        else if(a[i]==3){
            string p;
            cin>>p;
            cout<<mark[p]<<'\n';
        }
    } 
}

Comments

Post a Comment

Popular posts from this blog

Solution to the problem 'The Squid Game' form Codechef

Hola! Here's my solution to the problem 'The Squid Game' from Codechef Infinity 2K21 Division 3. Question link:  https://www.codechef.com/INFI21C/problems/SQUIDRULE #include <bits/stdc++.h> #define int long long #define pb push_back #define fi first #define se second #define pii pair < int,int > using namespace std ; int32_t main () {     ios_base :: sync_with_stdio ( false );     cin . tie ( NULL );     cout . tie ( NULL );     int t ;     cin >> t ;     while ( t --){         int n , ans = 0 , m = 1e4 + 1 ;         cin >> n ;         for ( int i = 0 ; i < n ; i ++){             int x ;             cin >> x ;             ans += x ;             if ( x < m ) m = x ;         ...
Read more

Solution of 'Tom Riddle's Diary' (Codeforces)

  Hey everyone! Here's my solution of the question- Tom Riddle's Diary from Codeforces. If you guys have any suggestion do comment. T.Y. and Happy coding. question link: https://codeforces.com/contest/855/problem/A #include   <bits/stdc++.h> using   namespace   std ;   int   main () {      vector < string > v ;      int   n ;      cin >> n ;      string   a [ n ];      for ( int   i = 0 ; i < n ; i ++){          string   p ;          cin >> p ;          v . push_back ( p );          int   h = count ( v . begin (),  v . end (), p );          if ( h == 1 )  a [ i ] = "NO" ;     ...
Read more

Solution to the problem 'Red Light, Green Light' from Codechef

Question Link:  https://www.codechef.com/INFI21C/problems/DOLL #include <bits/stdc++.h> #define int long long #define pb push_back #define fi first #define se second #define pii pair < int,int > using namespace std ; int32_t main () {     ios_base :: sync_with_stdio ( false );     cin . tie ( NULL );     cout . tie ( NULL );     int t ;     cin >> t ;     while ( t --){         int n , k , ans = 0 ;         cin >> n >> k ;         for ( int i = 0 ; i < n ; i ++){             int x ;             cin >> x ;             if ( x > k ) ans ++;         }         cout << ans << ' \n ' ;     }     return 0 ; }
Read more