Queue at the School
== time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output==
During the break the schoolchildren, boys and girls, formed a queue of n people in the canteen. Initially the children stood in the order they entered the canteen. However, after a while the boys started feeling awkward for standing in front of the girls in the queue and they started letting the girls move forward each second.
Let’s describe the process more precisely. Let’s say that the positions in the queue are sequentially numbered by integers from 1 to n, at that the person in the position number 1 is served first. Then, if at time x a boy stands on the i-th position and a girl stands on the (i + 1)-th position, then at time x + 1 the i-th position will have a girl and the (i + 1)-th position will have a boy. The time is given in seconds.
You’ve got the initial position of the children, at the initial moment of time. Determine the way the queue is going to look after t seconds.
Input
The first line contains two integers n and t (1 ≤ n, t ≤ 50), which represent the number of children in the queue and the time after which the queue will transform into the arrangement you need to find.
The next line contains string s, which represents the schoolchildren’s initial arrangement. If the i-th position in the queue contains a boy, then the i-th character of string s equals “B”, otherwise the i-th character equals “G”.
Output
Print string a, which describes the arrangement after t seconds. If the i-th position has a boy after the needed time, then the i-th character a must equal “B”, otherwise it must equal “G”.
Examples
input
5 1
BGGBG
output
GBGGB
input
5 2
BGGBG
output
GGBGB
input
4 1
GGGB
output
GGGB
问题链接:Queue at the School.
问题简述:
第一行:输入两个数n(队列长度),t(时间)(1 ≤ n, t ≤ 50);
第二行:输入n个字符,字符由G(女生),B(男生)构成;
男生不想排在女生前面,每秒和后面的女生交换位置。
问题分析:
数据不大,直接按题目所给步骤计算。
程序说明:
AC通过的程序:
#include<iostream>
#include<string>
using namespace std;
int main()
{
int num,t;
cin>>num>>t;
string a;
a = "/n";
getline(cin,a);getline(cin,a);
for(int i = 0;i<t;i++)
{
for (int j = 0;j<num-1;j++)
{
if(a[j] == 'B'&& a[j+1] == 'G')
{
a[j] = 'G';a[j+1] = 'B';
j++;
}
}
}
cout<<a;
return 0;
}