【水字符】#55 A. Word

最新推荐文章于 2024-05-23 11:33:56 发布

原创最新推荐文章于 2024-05-23 11:33:56 发布 · 1.2k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#水题 #codeforces

CF-A题终结者同时被 2 个专栏收录

96 篇文章

订阅专栏

CF-A Terminator

88 篇文章

订阅专栏

本文介绍了一个简单的程序实现，用于将输入的包含大小写字母的单词转换为全部大写或全部小写，以解决网上常见的字母混用问题。通过遍历单词并计数大写和小写字母的数量，最终根据数量决定转换方式。

Vasya is very upset that many people on the Net mix uppercase and lowercase letters in one word. That's why he decided to invent an extension for his favorite browser that would change the letters' register in every word so that it either only consisted of lowercase letters or, vice versa, only of uppercase ones. At that as little as possible letters should be changed in the word. For example, the word HoUse must be replaced with house, and the word ViP — with VIP. If a word contains an equal number of uppercase and lowercase letters, you should replace all the letters with lowercase ones. For example, maTRIx should be replaced by matrix. Your task is to use the given method on one given word.

Input

The first line contains a word s — it consists of uppercase and lowercase Latin letters and possesses the length from 1 to 100.

Output

Print the corrected word s. If the given word s has strictly more uppercase letters, make the word written in the uppercase register, otherwise - in the lowercase one.

Sample test(s)

input
HoUse

output
house

input
ViP

output
VIP

input
maTRIx

output
matrix

如果大写字符多就把字符串全大写，小写字符多或者大小写一样多就把字符串全都变小写

for一次来遍历数数，

再for一次输出即可。

Code：

#include <cstdio>
#include <memory>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
	int u=0,l=0;
	string s;	cin>>s;
	for(int i=0;i<s.length();i++)
		if(isupper(s[i])) u++;
		else l++;
	for(int i=0;i<s.length();i++)
		printf( "%c",((u>l) ? toupper(s[i]):tolower(s[i]) ) );
	return 0;
}