A. Boys and Girls
http://codeforces.com/problemset/problem/253/A
time limit per test
memory limit per test
input
output
n boys and m girls studying in the class. They should stand in a line so that boys and girls alternated there as much as possible. Let's assume that positions in the line are indexed from left to right by numbers from 1 to n + m. Then the number of integers i(1 ≤ i < n + m) such that positions with indexes i and i + 1 contain children of different genders (position i has a girl and position i + 1has a boy or vice versa) must be as large as possible.
Help the children and tell them how to form the line.
Input
n and m (1 ≤ n, m ≤ 100), separated by a space.
Output
n + m characters. Print on the i-th position of the line character "B", if the i-th position of your arrangement should have a boy and "G", if it should have a girl.
B" should equal n and the number of characters "G" should equal m. If there are multiple optimal solutions, print any of them.
Sample test(s)
input
3 3
output
GBGBGB
input
4 2
output
BGBGBB
water.
完整代码：
/*30ms,100KB*/
#include<cstdio>
int main()
{
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
int n, m;
scanf("%d%d",&n,&m);
if (n > m)
{
int diff = n - m;
while (m--)
{
putchar('B');
putchar('G');
}
while (diff--)
putchar('B');
}
else
{
int diff = m - n;
while (n--)
{
putchar('G');
putchar('B');
}
while (diff--)
putchar('G');
}
return 0;
}
