Answer:
10000 options
Step-by-step explanation:
There are 10 options of digit from 0 to 9. It means there are 10 options for the first slot, 10 for the 2nd slot, 10 for the 3rd slot, and 10 for the last slot of each of the 4 slots of the password. For all 4 passwords the total amount of choices would be
Answer:
2/3
Step-by-step explanation:
Yes it would be the opposite for example -12 it would be 12 and then 13 would stay 13
Answer:
4 I think is the answer
Step-by-step explanation:
Answer:
// C++ Program to arithmetic operationf on 2 Numbers using Recursion
// Comments are used for explanatory purpose
#include <bits/stdc++.h>
using namespace std;
// add10 recursive function to perform arithmetic operations
int add10(int m, int n)
{
return (m + product(n, 10)); //Result of m + n * 10
return 0;
}
// Main Methods Starts here
int main()
{
int m, n; // 2 Variables m and n declared as integer
cin>>m; // accept input for m
cin>>n; // accept input for n
cout << "Result : "<<add10(m,n); // Print results which is calculated by m + 10 * n
return 0;
}
