757A - Gotta Catch Em' All - CodeForces Solution


implementation *1000

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
#define ll long long
using namespace std;


int main() {
  int t = 1;
  //cin >> t;
  while (t--) {
        string refe = "Bulbsr";
        map <char , int> k;
        string f;
        cin >> f;
        for(int i = 0; i < f.size();i++){
            k[f[i]]++;
        }
        int mx = f.size();
        for(int i = 0;i < 6;i++){
            mx = min(k[refe[i]] , mx);
        }
        mx = min(mx , k['a']/2);
        mx = min(mx , k['u']/2);
        cout<<mx;
    }
}


Comments

Submit
0 Comments
More Questions

237. Delete Node in a Linked List
27. Remove Element
39. Combination Sum
378. Kth Smallest Element in a Sorted Matrix
162. Find Peak Element
1529A - Eshag Loves Big Arrays
19. Remove Nth Node From End of List
925. Long Pressed Name
1051. Height Checker
695. Max Area of Island
402. Remove K Digits
97. Interleaving String
543. Diameter of Binary Tree
124. Binary Tree Maximum Path Sum
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts
501A - Contest
160A- Twins
752. Open the Lock
1535A - Fair Playoff
1538F - Interesting Function
1920. Build Array from Permutation
494. Target Sum
797. All Paths From Source to Target
1547B - Alphabetical Strings
1550A - Find The Array
118B - Present from Lena
27A - Next Test
785. Is Graph Bipartite
90. Subsets II
1560A - Dislike of Threes