A website requires that passwords only contain alphabetic characters or numbers. For each character in codeStr that is not an alphabetic character or number, replace the character with 'x'. C++ Ex: If the input is 3!fgMB, then the output is: Updated password: 3xfgMB Note: isalpha() returns true if a character is alphabetic, and false otherwise. Ex: isalpha('a') returns true. isalpha('8') returns false. isdigit() returns true if a character is a digit, and false otherwise. Ex: isdigit('8') returns true. isdigit('a') false #include #include using namespace std; int main() { string codeStr; unsigned int i; cin >> codeStr; codeStr.at(1) = 'x'; for (i + 0; i < codeStr.size(); ++i) { if (isalpha (codeStr.at(1))) { i += 1; } } cout << "Updated password: " << codeStr << endl; return 0; } cout<<"Updated password: "<
A website requires that passwords only contain alphabetic characters or numbers. For each character in codeStr that is not an alphabetic character or number, replace the character with 'x'. C++
Ex: If the input is 3!fgMB, then the output is:
Updated password: 3xfgMB
Note:
- isalpha() returns true if a character is alphabetic, and false otherwise. Ex: isalpha('a') returns true. isalpha('8') returns false.
- isdigit() returns true if a character is a digit, and false otherwise. Ex: isdigit('8') returns true. isdigit('a') false
#include <iostream>
#include <string>
using namespace std;
int main() {
string codeStr;
unsigned int i;
cin >> codeStr;
codeStr.at(1) = 'x';
for (i + 0; i < codeStr.size(); ++i) {
if (isalpha (codeStr.at(1))) {
i += 1;
}
}
cout << "Updated password: " << codeStr << endl;
return 0;
}
Algorithm of the code:
1. Prompt the user to enter a string.
2. Store the string in a variable called codeStr.
3. Create a loop that iterates through each character of the codeStr.
4. For each character of the codeStr, check if the character is an alphabet or a digit.
5. If the character is not an alphabet or a digit, replace it with 'x'.
6. Print out the updated password.
7. Exit the program.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
