Codeforces Round #242 (Div. 2) A. Squats
来源:互联网 发布:php from unixtime 编辑:程序博客网 时间:2024/05/18 09:44
Pasha has many hamsters and he makes them work out. Today, n hamsters (n is even) came to work out. The hamsters lined up and each hamster either sat down or stood up.
For another exercise, Pasha needs exactly hamsters to stand up and the other hamsters to sit down. In one minute, Pasha can make some hamster ether sit down or stand up. How many minutes will he need to get what he wants if he acts optimally well?
The first line contains integer n (2 ≤ n ≤ 200;n is even). The next line contains n characters without spaces. These characters describe the hamsters' position: thei-th character equals 'X', if thei-th hamster in the row is standing, and 'x', if he is sitting.
In the first line, print a single integer — the minimum required number of minutes. In the second line, print a string that describes the hamsters' position after Pasha makes the required changes. If there are multiple optimal positions, print any of them.
4xxXx
1XxXx
2XX
1xX
6xXXxXx
0xXXxXx题意:将X变成n/2个
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>using namespace std;const int maxn = 300;char str[maxn];int main() {int n;scanf("%d", &n);scanf("%s", str);int ans = 0;for (int i = 0; i < n; i++)if (str[i] == 'X')ans++;int flag = ans > (n/2) ? 1 : 0;ans = abs(ans - (n/2));printf("%d\n", ans);int cnt = 0;for (int i = 0; i < n; i++) {if (cnt >= ans || ans == 0)break;if (flag && str[i] == 'X') {str[i] = 'x';ans--;}else if (!flag && str[i] == 'x') {str[i] = 'X';cnt++;}}printf("%s\n", str);return 0;}
- Codeforces Round #242 (Div. 2) A. Squats
- Codeforces Round #242 (Div. 2) A. Squats
- Codeforces Round #242 (Div. 2) A. Squats
- codeforces 424A Squats
- Codeforces Round #242 (Div. 2) <A-D>
- Codeforces Round #242 (Div. 2) (A、B、C)
- Codeforces Round #131 (Div. 2) A B
- Codeforces Round #174 (Div. 2) Problem A
- Codeforces Round #173 (Div. 2) A.Bit++
- Codeforces Round #181 (Div. 2) A题
- Codeforces Round #184 (Div. 2) A题
- Codeforces Round #185 (Div. 2)--A,B
- Codeforces Round #172 (Div. 2) A题
- Codeforces Round #166 (Div. 2) A题
- Codeforces Round #132 (Div. 2) A题
- Codeforces Round #131 (Div. 2) A题
- Codeforces Round #133 (Div. 2) A题
- Codeforces Round #137 (Div. 2) A题
- 小米明年卖一亿台底气在哪里?
- ucgui界面设计&实体按键驱动
- hdoj 1266 Reverse Number
- opencv视频播放
- java 虚拟机--新生代与老年代GC
- Codeforces Round #242 (Div. 2) A. Squats
- java网络编程(2)InetAddress 类及udp协议
- nagios高级玩法-如何解决验证问题
- Gentoo:startx出现Failed to load module问题
- css盒子模型及实例
- java 导出并下载excel
- 获取MAC地址方法大全
- 西林街网盘搜索 千万亿网盘资源
- 如何使用 Xmanager 登录 Linux