RECONSTRUCT THE GENOME 5.2

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c)   min(a, min(b, c))
#define max3(a, b, c)   max(a, max(b, c))
#define F first
#define S second
#define in  freopen("input.txt", "r", stdin)
#define out  freopen("output.txt", "w", stdout)
#define minheap int,vector<int>,greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x)  (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) ((ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')||(ch=='A'|| ch=='E' || ch=='I'|| ch=='O'|| ch=='U'))
#define bug cout<<"BUG"<<endl;
const int Max = 2e5 + 10;
const int Mod = 1e9 + 7;
const double PI  =3.141592653589793238463;
bool compare(const string &a, const string &b)
{
    for(ll i=0; i<a.size(); i++)
    {
        if(a[i]!=b[i] && (a[i]=='$' || b[i]=='$'))
        {

            if(a[i]=='$')return 1;

            else if(b[i]=='$')return 0;
        }

        else if(a[i]<b[i])return 1;

        else if(a[i]>b[i])return 0;
    }

    return 1;
}
ll lcm(ll a,ll b)
{
    if(a==0 || b==0)return 0;

    return a/__gcd(a,b)*b;
}

void input(ll ara[],ll n)
{
    for(ll i=0; i<n; i++)cin>>ara[i];
}
void print(ll ara[],ll n)
{
    for(ll i=0; i<n; i++)
        cout<<ara[i]<<" ";
    cout<<endl;
}


int main()
{

    fastread();

    ll i,j,n,m,p,a,sum=0,k,t,b,c,d,cnt=0,q,l,r,ans=0;

    bool flag=false;



    string genome;

    cout<<"input the genome"<<endl;

    cin>>genome;

    n=genome.size();

    string bwt[n],currentBwt[n];

    for(i=0; i<n; i++)
    {

        currentBwt[i]=bwt[i]=genome[i];
    }

    sort(currentBwt,currentBwt+n,compare);

    cout<<endl;

    while(currentBwt[0].size()<n)
    {

        for(i=0; i<n; i++)
            currentBwt[i]=bwt[i]+currentBwt[i];

        sort(currentBwt,currentBwt+n,compare);

         for(i=0; i<n; i++)
        cout<<currentBwt[i]<<endl;

        cout<<endl<<endl;
    }


    for(i=0; i<n; i++)
        cout<<currentBwt[i]<<endl;




}