Codeforces 424A (思维题)
2016-04-23 18:36
357 查看
Squats
Submit Status
Description
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?
Input
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: the i-th character equals 'X', if the i-th hamster in the row is standing, and 'x', if he is sitting.
Output
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.
Sample Input
Input
Output
Input
Output
Input
Output
Source
Codeforces Round #242 (Div. 2)
题意:一个字符串有n个字符,每个字符不是x就是X,现要求让x和X的个数相等,输出最小的转换次数和转换后的字符串。
题解:统计x和X的个数设为a,b,c=min(a,b),转换最小次数为n/2-a,随便转换几个x或者X然后输出就行了。
Time Limit: 1000MS | Memory Limit: 262144KB | 64bit IO Format: %I64d & %I64u |
Description
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?
Input
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: the i-th character equals 'X', if the i-th hamster in the row is standing, and 'x', if he is sitting.
Output
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.
Sample Input
Input
4 xxXx
Output
1 XxXx
Input
2 XX
Output
1 xX
Input
6 xXXxXx
Output
0 xXXxXx
Source
Codeforces Round #242 (Div. 2)
题意:一个字符串有n个字符,每个字符不是x就是X,现要求让x和X的个数相等,输出最小的转换次数和转换后的字符串。
题解:统计x和X的个数设为a,b,c=min(a,b),转换最小次数为n/2-a,随便转换几个x或者X然后输出就行了。
相关文章推荐
- Linux下PHP安装配置MongoDB
- IDA远程调试 在内存中dump Dex文件
- ZOJ Highway Project(dijkstra&heap&邻接表)
- java初学
- spoj 16892 Straight Line Spiral Pattern (Act 1)
- 遍历项目中用到的所有字符,过滤掉重复字符后存入指定文件
- 一探究竟之PullZoomView
- IDA 6.0设置WinDbg调试器路径
- 编程之美最大公约数
- 【读书笔记】Android安全机制解析与应用实践之安卓的启动
- uboot移植之前的工作
- LeetCode 124 Binary Tree Maximum Path Sum
- Android Studio 经常使用功能介绍
- new start
- 关于ARM的B,BL跳转指令
- HDU5673 Robot 默慈金数
- 商业研究(11):金融招聘,大有可为?
- 商业研究(11):金融招聘,大有可为?
- 商业研究(11):金融招聘,大有可为?
- 使用Retrofit2.0实现GoogleDrive相关API