Answer:
In Python:
def fib(nterms):
n1, n2 = 1, 1
count = 0
while count < nterms:
term = n1
nth = n1 + n2
n1 = n2
n2 = nth
count += 1
return term
Explanation:
This line defines the function
def fib(nterms):
This line initializes the first and second terms to 1
n1, n2 = 1, 1
This line initializes the Fibonacci count to 0
count = 0
The following while loops gets the number at the position of nterms
<em> while count < nterms:
</em>
<em> term = n1
</em>
<em> nth = n1 + n2
</em>
<em> n1 = n2
</em>
<em> n2 = nth
</em>
<em> count += 1
</em>
This returns the Fibonnaci term
return term
Jobs was less hands-on when it came to developing computer software, and instead focused on design, advertising and talking to press, Wozniak said. “One thing he wanted was to somehow be important in the world, though he didn't have the academic or business, background, he had me,” he said.
You can't sorry, i dont like the update either :(
int main() {
string simon_Pattern;
string user_Pattern;
int userScore;
int i;
user_Score = 0;
simon_Pattern = "RRGBRYYBGY";
user_Pattern = "RRGBBRYBGY";
for (i = 0; i <= simson_pattern.length; i++) {
if (simon_Pattern[i] == user_Pattern[i]) {
user_Score = user_Score + 1;
} else {
break;
}
}
cout << "userScore: " << user_Score << endl;
return 0;
}
Here it uses two string variable to store “simson’s pattern and user’s pattern”. Then a “for loop” is executed till the end of the string. Inside the for loop both the strings are compared character by character and when found the score is added. If not for loop is exited and finally the score is displayed.
Uh, I think you mean antonym.
Anyways, here are some antonyms.
Careless, Certain, Foolish, Inattentive, Incautious
