Codeforces 59A

-

                                           

                                           A. Word

time limit per test
2 seconds
memory limit per test
256 megabytes

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.

Examples
Input
Copy
HoUse
Output
Copy
house
Input
Copy
ViP
Output
Copy
VIP
Input
Copy
maTRIx
Output
Copy
matrix




Solution:

  1. #include <iostream>
  2. #include<string>
  3. #include <cstring>
  4. using namespace std;
  5.  
  6. int main() {
  7. string str ;cin>>str;
  8. int ln=str.length(); int check=0;
  9. int small=0,cap=0;
  11. for(int i=0;i<ln ;i++)
  12. {
  13. if(str[i] >= 'A' and str[i]<='Z')
  14. cap++;
  15. else small++;
  16. }
  18. if (cap > small)
  19. for(int i=0;i<ln ;i++)
  20. str[i]= toupper(str[i]);
  23. else
  24. for(int i=0;i<ln ;i++)
  25. str[i]=tolower(str[i]);
  26.  
  28. cout<<str<< endl;
  29. return 0;
  32. }

Comments

Post a Comment

Popular posts from this blog

595A. Vitaly and Night

-
One day Vitaly was going home late at night and wondering: how many people aren't sleeping at that moment? To estimate, Vitaly decided to look which windows are lit in the house he was passing by at that moment. Vitaly sees a building of  n  floors and  2· m  windows on each floor. On each floor there are  m  flats numbered from  1  to  m , and two consecutive windows correspond to each flat. If we number the windows from  1  to  2· m  from left to right, then the  j -th flat of the  i -th floor has windows  2· j  - 1  and  2· j  in the corresponding row of windows (as usual, floors are enumerated from the bottom). Vitaly thinks that people in the flat aren't sleeping at that moment if  at least one  of the windows corresponding to this flat has lights on. Given the information about the windows of the given house, your task is to calculate the number of flats where, ac...
Read more

1096A Find Divisible codeforces

-
Problem link Solution O(1) #include <stdio.h> #include <iostream> using namespace std ; int main () { long int l , r ; int t ; cin >> t ;   long int x = l , y = r ; while ( t --) { scanf ( "%ld" ,& l ); scanf ( "%ld" ,& r ); y = r ; int mod =( r % l ); cout << l << " " << r - mod << endl ;   mod = 0 ;     } return 0 ;}
Read more

798A - Mike and palindrome

-
                                                             798A  -   . Mike and palindrome              memory limit per test 256 megabytes input standard input output standard output Mike has a string  s  consisting of only lowercase English letters. He wants to  change exactly one  character from the string so that the resulting one is a palindrome. A palindrome is a string that reads the same backward as forward, for example strings " z ", " aaa ", " aba ", " abccba " are palindromes, but strings " codeforces ", " reality ", " ab " are not. Input The first and single line contains string  s  ( 1 ≤ | s | ≤ 15 ). Output Print " YES " (without quotes) if Mike can change  exactly  one character so that the resulting string is palindrome or " NO " (wi...
Read more