Explanation:
This is easily solvable with a for loop. Something like:
(I assume c++)
#include <iostream>
#include <string>
int main() {
take_input: //tag
std::string input;
cin >> input; //take the input
int spaceCount = 0;
char checking;
for(unsigned int i = 0; i == input.length(); ++i) {
checking = spaceCount[i];
if(checking == ' ')
spaceCount++;
}
if(spaceCount >= 1 && input.length >= 5)
std::cout << "Your name is " + input;
else
goto take_input; // reasks for input if the conditions are not met
return 0;
};
**remove all spaces before using the code, the if statements are messed up
Answer:
One of them is OnClick, but there are more.
Explanation:
I took my post test and only clicked OnClick and I missed this one and it says "not all correct answers chosen"
Answer:
The number of subproblems are given as 
while the value of T(n) to be less than S(n) is for 342.
Explanation:
The number of subproblems are given as
Asymptotic running time for Strassen’s algorithm is 
Now, when a increases, number of subproblems determines the asymptotic running time of the problem and case 1 of master theorem applies. So, in worst case, asymptotic running time of the algorithm will be
Now, for T(n) to be smaller than S(n)
So,
So,
a=342
