MYMEMORY WARNING: YOU USED ALL AVAILABLE FREE TRANSLATIONS FOR TODAY. NEXT AVAILABLE IN 23 HOURS 57 MINUTES 14 SECONDS VISIT HTTPS://MYMEMORY.TRANSLATED.NET/DOC/USAGELIMITS.PHP TO TRANSLATE MORE
Closed 10 mins ago.
MYMEMORY WARNING: YOU USED ALL AVAILABLE FREE TRANSLATIONS FOR TODAY. NEXT AVAILABLE IN 23 HOURS 57 MINUTES 13 SECONDS VISIT HTTPS://MYMEMORY.TRANSLATED.NET/DOC/USAGELIMITS.PHP TO TRANSLATE MORE
#include <iostream>
#include <vector>
#include <string>
std::string capSpace(std::string txt) {
std::vector <char> un_cap;
std::vector <char> caps = { A , B , C , D , E , F , G , H , I , J , K , L , M , N , O , P , Q , R , S , T , U , V , W , X , Y , Z };
std::vector <char> small = { a , b , c , d , e , f , g , h , i , j , k , l , m , n , o , p , q , r , s , t , u , v , w , x , y , z };
for (int i=1; i<=txt.size(); i++) {
un_cap.push_back(txt[i-1]);
}
for (int j=1; j<=un_cap.size(); j++) {
for (int k=1; k<= caps.size(); k++) {
if (caps[k-1] == un_cap[j-1]) {
un_cap[j-1] == small[k-1];
un_cap.push_back( );
for (int l= un_cap.size(); l>= j+1; l--) {
un_cap[l-1] == un_cap[l-2];
}
un_cap[j-1] = ;
k = caps.size();
}
}
}
for (int m=1; m<=un_cap.size(); m++) {
txt[m-1] = un_cap[m-1];
}
return txt;
}
int main() {
std::string text;
std::cout << "Enter a text to uncap and space ";
std::cin >> text;
capSpace(text);
std::cout << "The uncapped version is " << text << "
";
}
MYMEMORY WARNING: YOU USED ALL AVAILABLE FREE TRANSLATIONS FOR TODAY. NEXT AVAILABLE IN 23 HOURS 57 MINUTES 11 SECONDS VISIT HTTPS://MYMEMORY.TRANSLATED.NET/DOC/USAGELIMITS.PHP TO TRANSLATE MORE