find is number prime
int number;
cin >> number;
if (number == 2) {
cout << "Prime" << endl;
return;
}else if(number == 1 || number % 2 == 0){
cout << "Not prime" << endl;
return;
}
for (int i = 3; i * i <= number; i+=2) {
if(number % j == 0){
cout << "Not prime" << endl;
return;
}
}
cout << "Prime" << endl;
return;
4.13
8
#include <stdio.h>
int main() {
int n, i, flag = 0;
printf("Enter a positive integer: ");
scanf("%d", &n);
for (i = 2; i <= n / 2; ++i) {
// condition for non-prime
if (n % i == 0) {
flag = 1;
break;
}
}
if (n == 1) {
printf("1 is neither prime nor composite.");
}
else {
if (flag == 0)
printf("%d is a prime number.", n);
else
printf("%d is not a prime number.", n);
}
return 0;
}
Thank you!
8
0
Are there any code examples left?
New code examples in category Other