CodeForces-266B Queue at the School

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
#include <iostream>
#include <cstring>
#include <cstdio>

using namespace std;

const int nt_max = 50 + 5;
int n, t, cnt;
char Queue[nt_max];

int main()
{
    while(~scanf("%d %d", & n, & t))
    {
        scanf("%s", Queue);
        while(t --)
        {
            for(int i = 0; i < n; )
            {
                if(Queue[i] == 'B')
                {
                    if(Queue[i + 1] == 'G')
                    {
                        Queue[i] = 'G';
                        Queue[i + 1] = 'B';
                        i += 2;
                    }
                    else
                        i ++;
                }
                else
                    i ++;
            }
        }
        printf("%sn", Queue);
    }
    return 0;
}