Boys_and_Girls

Description
input
input.txt
output
output.txt
There are 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?+?1 has a boy or vice versa) must be as large as possible.


Help the children and tell them how to form the line.


Input
The single line of the input contains two integers n and m (1?≤?n,?m?≤?100), separated by a space.


Output
Print a line of 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.


Of course, the number of characters "B" should equal n and the number of characters "G" should equal m. If there are multiple optimal solutions, print any of them.


Sample Input
Input
3 3
Output
GBGBGB
Input
4 2
Output
BGBGBB
Hint
In the first sample another possible answer is BGBGBG.

In the second sample answer BBGBGB is also optimal.

题意大概是将男女分隔开轮流坐吧，问怎样坐才尽可能地轮流。我的做法是分情况讨论的，男多女少，女少男多的情况

#include<iostream>
int main()
{
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout);
	int n,m,number;
	scanf("%d %d",&n,&m);
	if(n>m)
	{
		number=n-m;
		while(m--)
			printf("BG");
		while(number--)
			printf("B");
	}
	else
	{
		number=m-n;
		while(n--)
			printf("GB");
		while(number--)
			printf("G");
	}
	return 0;
}