aboutsummaryrefslogtreecommitdiff
path: root/PerfectlyBalancedString.cpp
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-09 16:54:41 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-09 16:54:41 +0200
commit79d618f6b9a45d82023792140e70d271485cf005 (patch)
tree55dd529dbea2327d0a23e80b78f8912e73633e6d /PerfectlyBalancedString.cpp
parentc7cecfca5337473def7f1c9adba208ab33a11c8e (diff)
downloadcompetitive-programming-79d618f6b9a45d82023792140e70d271485cf005.tar.xz
competitive-programming-79d618f6b9a45d82023792140e70d271485cf005.zip
Added some new problems
Diffstat (limited to 'PerfectlyBalancedString.cpp')
-rw-r--r--PerfectlyBalancedString.cpp33
1 files changed, 33 insertions, 0 deletions
diff --git a/PerfectlyBalancedString.cpp b/PerfectlyBalancedString.cpp
new file mode 100644
index 0000000..a83c3f4
--- /dev/null
+++ b/PerfectlyBalancedString.cpp
@@ -0,0 +1,33 @@
+#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;
+ }
+}
+