-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA.cpp
58 lines (49 loc) · 1.17 KB
/
A.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
/***** American International University Bangladesh (AIUB)
Hadiur Rahman Nabil
*****/
#include <bits/stdc++.h>
#include<string>
using namespace std;
typedef long long ll;
int main()
{
int up=0,lo=0;
string s;
cin>>s;
for(int i=0; i<s.size(); i++)
{
if(isupper(s[i]))
{
up++;
}
else
{
lo++;
}
}
if(up<lo)
{
for(int i=0; i<s.size(); i++)
{
s[i]=tolower(s[i]);
}
cout<<s<<endl;
}
if(up>lo)
{
for(int i=0; i<s.size(); i++)
{
s[i]=toupper(s[i]);
}
cout<<s<<endl;
}
if(up==lo)
{
for(int i=0; i<s.size(); i++)
{
s[i]=tolower(s[i]);
}
cout<<s<<endl;
}
return 0;
}