Answer:
#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n)
{
for(int j=2;j<=n-1;j++) //loop to check prime..
{
if(n%j==0)
return false;
}
return true;
}
int main(){
int n;
cout<<"Enter the integer"<<endl;//taking input..
cin>>n;
if(isPrime(n))//printing the message.
{
cout<<"The number you have entered is prime"<<endl;
}
else
{
cout<<"The number is not prime"<<endl;
}
return 0;
}
Output:-
Enter the integer
13
The number you have entered is prime
Explanation:
The above written program is in C++.I have created a function called isPrime with an argument n.I have used a for loop to check if the number is prime or not.In the main function I have called the function isPrime for checking the number is prime or not.
Answer: The following code is in c++
#include <iostream>
#include<math.h>
using namespace std;
int main()
{
float a,b,c;
cout<<"Enter height and base of triangle\n";
cin>>a>>b; //reading two sides from user
c=sqrt(pow(a,2)+pow(b,2)); //calculating hypotenuse
cout<<"Length of hypotenuse is "<<c; //printing third side of triangle
return 0;
}
OUTPUT :
Enter height and base of triangle
3
4
Length of hypotenuse is 5
Explanation:
In the above code, three variables a, b and c of int type are declared. After that, it is asked from user to enter the value of a and b. The user puts the value and then c is calculated with the help of Pythagoras theorem formulae which squares the values of two sides and then adds them to calculate hypotenuse of a right angled triangle and finally c is printed to console.
Answer:
A.mechanical hard
Explanation:
brainliest me and follow ty
It depends on the problem. If you are solving a conplex one or simple
