今日sb题之 sdnuoj 1064

 

#include <iostream>
#include <string>
#include <stdio.h>
#include <cmath>
#include <algorithm>
using namespace std;

bool judge(string &s)
{
    if ( abs (count(s.begin(),s.end(),'B') - (count(s.begin(), s.end(), 'G') ) == 1) || count(s.begin(), s.end(), 'B') == (count(s.begin(), s.end(), 'G')))
        return true;
    else
        return false;
}


void printans(string &s)
{

    if (count(s.begin(), s.end(), 'B') - count(s.begin(), s.end(), 'G') == 1)
    {
        int n = count(s.begin(), s.end(), 'B');
        for (int i = 0; i < n-1; i++)
            cout << "BG";
        cout << "B" << endl;
    }
    if (count(s.begin(), s.end(), 'B') - count(s.begin(), s.end(), 'G') == -1)
    {
        int n = count(s.begin(), s.end(), 'G');
        for (int i = 0; i < n-1 ; i++)
            cout << "GB";
        cout << "G" << endl;
    }
    if (count(s.begin(), s.end(), 'B') == count(s.begin(), s.end(), 'G'))
    {
        int n = count(s.begin(), s.end(), 'G');
        for (int i = 0; i < n ; i++)
            cout << "BG";
        printf("
");
    }

}





int main()
{

        string s;
        while(cin >> s)
        {
            if (judge(s))
                printans(s);
            else
                cout << "No" << endl;

        } 
        
        


    return 0;
}

WA 了

我就是想复习复习string