Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <string>
- #include <sstream>
- #include <vector>
- #include <cmath>
- #include <algorithm>
- #include <memory.h>
- #include <stdio.h>
- #include <stack>
- #include <deque>
- #include <queue>
- #include <set>
- #include <iterator>
- #include <map>
- #include <iomanip>
- #include <unordered_set>
- #define int long long
- #define pb push_back
- #define double long double
- #define endl "\n"
- #define fir first
- #define sec second
- #define un unsigned
- #define INF 1000000007
- #define pii pair<int, int>
- #define all(v) v.begin(), v.end()
- using namespace std;
- const int N = 1000000, R = 1 << 18;
- const int MOD = 1e9 + 7;
- void solve()
- {
- string s;
- cin >> s;
- int n = s.size();
- int lol = 0, kek = 0;
- for (int i = 0; i < n - 1; i++)
- {
- if (s[i + 1] == 'a' && s[i] == 'b')
- {
- lol++;
- }
- else if (s[i + 1] == 'b' && s[i] == 'a')
- {
- kek++;
- }
- }
- lol = lol - kek;
- if (lol < 0 && s[0] == 'a')
- {
- s[0] = 'b';
- }
- if (lol > 0 && s[0] == 'b')
- {
- s[0] = 'a';
- }
- cout << s << endl;
- return;
- }
- signed main()
- {
- ios_base::sync_with_stdio(false);
- cin.tie(0);
- cout.tie(0);
- int n;
- cin >> n;
- for (int i = 0; i < n; i++)
- {
- solve();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement