aboutsummaryrefslogtreecommitdiff
path: root/PerfectlyBalancedString.cpp
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
commit3a89fc707253f75f46fd5a4822817f1fd5156c40 (patch)
tree474b08b187895af91c10838aae21142b2ba2514d /PerfectlyBalancedString.cpp
parentf5ff62a26052f084b6b807cba220c86785fd45e3 (diff)
downloadcompetitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.tar.xz
competitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.zip
Made that every problem is its own folder to make building the code a smooth operation with a shortcut
Diffstat (limited to 'PerfectlyBalancedString.cpp')
-rw-r--r--PerfectlyBalancedString.cpp33
1 files changed, 0 insertions, 33 deletions
diff --git a/PerfectlyBalancedString.cpp b/PerfectlyBalancedString.cpp
deleted file mode 100644
index a83c3f4..0000000
--- a/PerfectlyBalancedString.cpp
+++ /dev/null
@@ -1,33 +0,0 @@
-#include <algorithm>
-#include<bits/stdc++.h>
-using namespace std;
-int main() {
- int tt;
- cin >> tt;
- string s;
- while(tt--){
- cin >> s;
- bool ok = true;
- do{
- cout << s << endl;
- map<char, int> mp;
- for(auto ch : s) {
- mp[ch]++;
- }
- int mx = 1;
- int mn = 1;
- for(auto x : mp){
- mx = max(mx, x.second);
- mn = min(mn, x.second);
- // cout << x.first << " " << x.second << endl;
- }
- if(mx - mn > 1) {
- ok = false;
- break;
- }
- } while(next_permutation(s.begin(), s.end()));
- cout << (ok ? "YES" : "NO");
- cout << endl;
- }
-}
-