HackerEarth UpUp problem solution

In this HackerEarth UpUp problem solution You are given a string S. S consists of several words separated by one or more spaces. Word consists of Latin letters as well as other symbols (but not spaces).

In each word which starts from lowercase Latin letter replace starting letter with uppercase Latin letter.

HackerEarth UpUp problem solution.

#include<bits/stdc++.h>

using namespace std;

string st;
char up(char c)
{
  return c-'a'+'A';
}

int let(char c)
{
  return (c>='a'&&c<='z');
}

int main(){
ios_base::sync_with_stdio(0);

getline(cin,st);

if (let(st[0]))
  st[0]=up(st[0]);

for (int i=1;i<st.size();i++)
{
  if (let(st[i])==1&&st[i-1]==' ')
    st[i]=up(st[i]);
}
cout<<st<<endl;

return 0;}