CodeForces 1208 A. Boys and Girls 模拟序列
2012-12-08 20:10
274 查看
A. Boys and Girls
time limit per test 1 second
memory limit per test 256 megabytes
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 + 1has 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.
题目大意: n个男孩, m个女孩, 问(i,i+1) 两个小孩性别不一样最对的情况下的排列, 多种任意输出一种即可
解题思路: 数量大的在外,小的在内, 多出来的放到后面即可。
解题代码:
View Code
time limit per test 1 second
memory limit per test 256 megabytes
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 + 1has 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.
题目大意: n个男孩, m个女孩, 问(i,i+1) 两个小孩性别不一样最对的情况下的排列, 多种任意输出一种即可
解题思路: 数量大的在外,小的在内, 多出来的放到后面即可。
解题代码:
View Code
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; char str[300]; int n, m; int main(){ freopen( "input.txt", "r", stdin); freopen( "output.txt", "w", stdout); while( scanf("%d%d",&n,&m) != EOF) { int i, flag = n > m ? 1 : 0; int num = 2*min(n,m); for( i = 0; i < num; i++) { if( flag == 1 ) //boy str[i] = (i&1) ? 'G' : 'B'; else str[i] = (i&1) ? 'B' : 'G'; } for(i = num; i < num+max(n,m)-min(n,m); i++) str[i] = (flag) ? 'B' : 'G'; str[i] = '\0'; puts(str); } return 0; }
相关文章推荐
- xtu1146 Boys and Girls 简单模拟
- HDU 1068 Girls and Boys(二分图最大独立点集,3级)
- hdu 1068 Girls and Boys(二分匹配)
- Girls and Boys (最大独立集)
- hdu1068 Girls and Boys 二分匹配
- POJ 1466 Girls and Boys 最大独立集
- HDU 1068 Girls and Boys(最大独立集)
- hdu 1068 Girls and Boys(二分图匹配)
- HDU 1068 Girls and Boys
- [CQOI 2018]异或序列&[Codeforces 617E]XOR and Favorite Number
- hdu 1068 Girls and Boys (最大独立集)
- hdu 1068 Girls and Boys
- HDU2690 Boys and girls
- 杭电1068 Girls and Boys
- POJ 1466 Girls and Boys(二分图最大独立集)
- hdu 1068 Girls and Boys(最大独立集·maxmatch匈牙利)
- Girls and Boys||HDU1068
- hihocoder#1529 : 不上升序列&&Codeforces-713C:Sonya and Problem Wihtout a Legend(思维)
- hdu1068(二分)Girls and Boys
- HDU 1068 Girls and Boys(最大点独立集-hungary)