Easyproblem

NC216132. Easyproblem

描述

Happy new year^_^!!! YYY as XXX's best friend, she will give XXX a gift on New Year's day. This gift is a string! Yes, the gift is a string of length n (n is an even number). Because XXX is a good student who loves learning, she will love this gift. This string consists of only two characters' x 'and' y '. But XXX is an obsessive-compulsive disorder! He cant't stand the thing which is single. Now XXX needs to change her gift into a string with the number of 'x' equal to the number of 'y'. Each modification is to change 'x' to 'y' or 'y' to 'x'. But she is busy with the final review recently. She wants to ask you to help her solve this problem. You need to find the minimum number of modifications so that the number of 'x' in the string is equal to the number of 'y'.
Note: The number of changes may be zero

输入描述

Enter a positive integer n in the first line
In the second line, enter a string containing only the characters' x 'and' y '
The range of n is 1 < = n < = 100

输出描述

Output a number k ,which means the minimum number of modifications in a single line.

示例1

输入:

2
xy

输出:

原站题解

上次编辑到这里，代码来自缓存点击恢复默认模板

C++(clang++11) 解法, 执行用时: 11ms, 内存消耗: 524K, 提交时间: 2021-01-22 16:14:18

#include<bits/stdc++.h>
using namespace std;
string s;
int n;
int main()
{
	cin>>n>>s;
	cout<<abs(count(s.begin(),s.end(),'x')-count(s.begin(),s.end(),'y'))/2;
}

pypy3 解法, 执行用时: 67ms, 内存消耗: 21196K, 提交时间: 2023-04-29 14:04:11

import math
a=int(input())
r=input()
ans=0
for i in r:
    if i=='x':
        ans+=1
print(int(math.fabs(ans-(a-ans)))//2)

Python3(3.9) 解法, 执行用时: 19ms, 内存消耗: 2808K, 提交时间: 2021-03-09 13:43:00

n=int(input())//2
a=input()
print(abs(a.count('x')-n))

上一题

下一题

详情