-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathABBalance.cpp
More file actions
112 lines (105 loc) · 2.11 KB
/
ABBalance.cpp
File metadata and controls
112 lines (105 loc) · 2.11 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
/*maruf_bro*/
#include <bits/stdc++.h>
using namespace std;
#define IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define ld long double
#define ll long long
#define vec vector<ll>
#define pb push_back
#define fcin(n) \
for (auto &x : n) \
cin >> x
#define fcout(n) \
for (auto x : n) \
cout << x << " "
#define YES puts("YES")
#define NO puts("NO")
#define endl '\n'
/*
"The harder the problem, the sweeter the victory. Keep coding!"
*/
int Case = 1;
void solve()
{
string s;
cin >> s;
int ab_c = 0, ba_c = 0;
string ab = "ab", ba = "ba";
int pos = 0;
while ((pos = s.find(ab, pos)) != string::npos)
{
ab_c++;
pos += ab.length();
}
pos = 0;
while ((pos = s.find(ba, pos)) != string::npos)
{
ba_c++;
pos += ba.length();
}
if (ab_c == ba_c)
{
cout << s << endl;
}
else
{
for (int i = 0; i < s.size(); i++)
{
int ab_c = 0, ba_c = 0;
if (s[i] == 'a')
{
s[i] = 'b';
}
else
{
s[i] = 'a';
}
for (int j = 0; j < s.size() - 1; j++)
{
if (s[j] == 'a' and s[j + 1] == 'b')
{
ab_c++;
j++;
}
}
for (int j = 0; j < s.size() - 1; j++)
{
if (s[j] == 'b' and s[j + 1] == 'a')
{
ba_c++;
j++;
}
}
if (ab_c == ba_c)
{
cout << s << endl;
break;
}
else
{
if (s[i] == 'a')
{
s[i] = 'b';
}
else
{
s[i] = 'a';
}
}
}
}
}
signed main()
{
IO;
int t;
cin >> t;
while (t--)
{
solve();
}
return 0;
}