<u>Answer:</u>
<em>int fNumber,scndNumber = -1, </em>
<em>dup = 0;
</em>
<em>do {
</em>
<em>cin >> fNumber;
</em>
<em>if ( scndNumber == -1) {
</em>
<em>scndNumber = fNumber;
</em>
<em>}
</em>
<em>else {
</em>
<em>if ( scndNumber == fNumber )
</em>
<em>duplicates++;
</em>
<em>else
</em>
<em>scndNumber = fNumber;
</em>
<em>}
</em>
<em>} while(fNumber > 0 ); </em>
<em>cout << dup;
</em>
<u>Explanation:</u>
Here three variables are declared to hold the first number which is used obtain all the inputs given by the user, second number to hold the value of <em>last encountered number and “dup” variable to count the number of duplicate values.</em>
<em>“Do-while”</em> loop help us to get the input check whether it is same as previous input if yes then it <em>adds to the duplicate</em> value otherwise the new previous value if stored.
Answer:
The recursion function is as follows:
def raise_to_power(num, power):
if power == 0:
return 1
elif power == 1:
return num
else:
return (num*raise_to_power(num, power-1))
Explanation:
This defines the function
def raise_to_power(num, power):
If power is 0, this returns 1
if power == 0:
return 1
If power is 1, this returns num
elif power == 1:
return num
If otherwise, it calculates the power recursively
else:
return (num*raise_to_power(num, power-1))
A word processor is a computer program or device that provides for input, editing, formatting and output of text, often with additional features.
