Answer
aight' so im finding it but i have to asnwer before someone else so look in the comments for it.
Explanation:
Just wait i getting it rn
The color sensor if i’m correct
Answer:
(Probably) unknown
Explanation:
First off, you have to get rblx to agree to re-open a deleted, which I can imagine would take a herculean effort and most likely a stream of emails and phone calls. If they happen to archive deleted accounts, they may be able to recover it, but this is done by humans, so there is no definitive way to find out how long it would take a human to do this. If deleted accounts aren't archived, then you're outta luck because they won't be able to get it back.
Answer:
Security Tab is the correct answer.
Explanation:
The Security Tab will enable the users to authorize anyone to use that file or directory.Many clients deleted the security tab because After that nobody can alter the security privileges on the device.
- With the help of the Security tab, we will minimize the ActiveX attacks on Internet Explorer. This option is available in the Internet Options of the dialog box.
- Other options are incorrect because they are not related to a given scenario.
Answer:
// here is code in c++.
#include <bits/stdc++.h>
using namespace std;
// function that return greatest common divisor
int g_c_d(int num1, int num2)
{
if (num1 == 0)
return num2;
return g_c_d(num2 % num1, num1);
}
// main function
int main()
{
// variables
int num1,num2;
cout<<"enter two numbers:";
// read two numbers from user
cin>>num1>>num2;
// call the function and print the gcd of both
cout<<"greatest common divisor of "<<num1<<" and "<<num2<<" is "<<g_c_d(num1.num2)<<endl;
}
Explanation:
Read two numbers from user and assign them to variables "num1" and "num2".Call the function g_c_d() with parameter "num1" and "num2".According to Euclidean algorithm, if we subtract smaller number from the larger one the gcd will not change.Keep subtracting the smaller one then we find the gcd of both the numbers.So the function g_c_d() will return the gcd of both the numbers.
Output:
enter two numbers:5 9
greatest common divisor of 5 and 9 is 1
enter two numbers:-25 15
greatest common divisor of -25 and 15 is 5
