Codeforces 59A Word Solution

Solve in C:

#include<stdio.h>
#include<string.h>
int main()
{

    char s[101];
    int i,j,len,lower=0,upper=0;
    while(scanf("%s",s)!=EOF)
    {
        len=strlen(s);
        for(i=0; i<len; i++)
        {
            if(s[i]>='a'&&s[i]<='z')
                lower++;
            else if(s[i]>='A'&&s[i]<='Z')
                upper++;
        }
        if(lower>upper)
        {
            printf("%s\n",strlwr(s));
        }
        else if(lower<upper)
        {
            printf("%s\n",strupr(s));
        }
        else if(lower==upper)
        {
            printf("%s\n",strlwr(s));
        }
        lower=0,upper=0;
    }

}


No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.