Skip to main content

codeforces-Word

#include<iostream>
using namespace std;
void process1(char str[])
{
  int i=0;
  while(str[i]!='\0')
  {
   if(str[i]>=65 and str[i]<=90)
   {
    str[i]=str[i]+32;
   }
   i++;
  }
}
void process2(char str[])
{
 int i=0;
 while(str[i]!='\0')
 {
  if(str[i]>=97 and str[i]<=122)
  {
   str[i]=str[i]-32;
  }
  i++;
 }
}
void check(char str[])
{
 int i=0,count=0,count1=0;
 while(str[i]!='\0')
 {
  if(str[i]>=65 and str[i]<=90)
  {
   count++;
  }
  else if(str[i]>=97 and str[i]<=122)
  {
   count1++;
  }
  i++;
 }
 if(count1==count)
  process1(str);
 else if(count1<count)
  process2(str);
 else if(count1>count)
  process1(str);
}
int main()
{
 char str[101];
 cin>>str;
 check(str);
 cout<<str;
 return 0;
}

Comments

Popular posts from this blog

BFS of a graph

#include<bits/stdc++.h> using namespace std; class graph {     int v;     list<int> *adj; public:     graph(int v)     {         this->v=v;         adj=new list<int>[v];     }     void add_edge(int v,int w)     {         adj[v].push_back(w);     }     void bfs(int start); }; void graph:: bfs(int start) {     bool *visited=new bool[v];     for(int i=0;i<v;i++)         visited[i]=false;     visited[start]=true;     list<int> queue;     queue.push_back(start);     while(!queue.empty())     {         int s=queue.front();         cout<<s<...

DFS using a stack

#include<bits/stdc++.h> using namespace std; class graph {     int v;     list<int> *adj; public:     graph(int v)     {         this->v=v;         adj=new list<int>[v];     }     void add_edge(int v,int w)     {         adj[v].push_back(w);     }     void dfs(int start); }; void graph:: dfs(int start) {     bool *visited=new bool[v];     for(int i=0;i<v;i++)         visited[i]=false;     visited[start]=true;     stack<int> s;     s.push(start);     while(!s.empty())     {         int k=s.top();         s.pop();       ...

DFS of a graph

#include<bits/stdc++.h> using namespace std; class graph {     int v;     list<int> *adj; public:     graph(int v)     {         this->v=v;         adj=new list<int>[v];     }     void add_edge(int v,int w)     {         adj[v].push_back(w);     }     void dfs(int v);     void dfsSearch(int v,bool visited[]); }; void graph:: dfsSearch(int start,bool visited[]) {     visited[start]=true;     cout<<start<<" ";     for(auto itr=adj[start].begin();itr!=adj[start].end();itr++)     {         if (!visited[*itr])         {             dfsSearch(*itr,visited); ...