CodeForces
来源:互联网 发布:大数据分析用的数据库 编辑:程序博客网 时间:2024/06/05 14:46
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.
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".
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".
5 1BGGBG
GBGGB
5 2BGGBG
GGBGB
4 1GGGB
GGGB
题意:队伍里有男孩跟女孩,共有n人,在x时刻第i位置站的是女孩,第i+1个位置站的是男孩,那么在x+1时刻i位置是男孩i+1位置是女孩。
#include<cstdio>#include<cstring>int main(){char s[100];int n,t;scanf("%d%d",&n,&t);getchar();for(int i=1;i<=n;i++){scanf("%c",&s[i]);}for(int k=1;k<=t;k++){for(int i=1;i<=n;){if(s[i]=='B'&&s[i+1]=='G'){s[i]='G';s[i+1]='B';i+=2;}else{i++;}}}for(int i=1;i<=n;i++){printf("%c",s[i]);}return 0;}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Python运维之路——协程、事件驱动与异步IO
- Java中状态模式和策略模式的区别
- 线段树: CDOJ1598-加帕里公园的friends(区间合并,单点更新)
- 山峰 2016暑假集训结训赛 by JueChen 栈的维护
- [日常训练] 秀姿势
- CodeForces
- Java排序算法之快速排序
- 关于CSS中的样式继承
- 51nod 4级算法-1405
- 内部类
- C语言之单链表(增删改查逆)
- uva694
- Java基础之继承、多态、重载、重写
- poj-1452-按天数卖东西