codeforces 154 Div2 A
2013-01-19 21:58
1121 查看
A. Boys and Girls
time limit per test
1 second
memory limit per test
256 megabytes
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 test(s)
input
output
input
output
Note
In the first sample another possible answer is BGBGBG.
In the second sample answer BBGBGB is also optimal.
水题, 优先输出多的内一方,之后间隔输出。
附代码:
time limit per test
1 second
memory limit per test
256 megabytes
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 test(s)
input
3 3
output
GBGBGB
input
4 2
output
BGBGBB
Note
In the first sample another possible answer is BGBGBG.
In the second sample answer BBGBGB is also optimal.
水题, 优先输出多的内一方,之后间隔输出。
附代码:
#include<fstream> using namespace std; int main( void) { int b, g, i=0, m; ifstream fin("input.txt"); ofstream fout("output.txt"); fin>>b>>g; m=b+g; if( b>g) { while( i<m) { if( b>0) { fout<<'B'; b--; i++; } if( g>0) { fout<<'G'; g--; i++; } } } else { while( i<m) { if( g>0) { fout<<'G'; g--; i++; } if( b>0) { fout<<'B'; b--; i++; } } } fout<<endl; return 0; }
相关文章推荐
- codeforces 154 DIV2
- codeforces 363A round211 div2 A.Soroban
- codeforces 155 Div2 B
- CodeForces 417C(RCC 2014 Warmup (Div. 2) C)(构造)
- codeforces水题100道 第十八题 Codeforces Round #289 (Div. 2, ACM ICPC Rules) A. Maximum in Table (brute force)
- 【Codeforces】Codeforces Round #374 (Div. 2) -- C. Journey (DP)
- [Codeforces Round #154 (Div. 2)]A. Boys and Girls
- codeforces 286 div2
- Codeforces 374 Div2
- CodeForces 154B——Colliders
- 【CodeForces】CodeForces Round #465 (Div. 2) 题解
- codeforces 163 Div2 B
- Codeforces-Div312
- 第九次codeforces竞技结束 #260 Div 2
- CodeForces 698A - Vacations (Codeforces Round #363 (Div. 2))
- Codeforces Round #347 (Div. 2) B. Rebus (codeforces 664b) (构造)
- codeforces 225 div2
- codeforces 428(div2) A-D
- [杂题] Codeforces 739D Round #381 (Div. 1) D. Recover a functional graph
- codeforces 250 div2 E