How to find the largest prime factor of a given integral number in C++

C++
x
20
#include <iostream>
using namespace std;
int main() {
int n, i;
bool isPrime = true;
cout << "Enter a positive integer: ";
cin >> n;
for(i = 2; i <= n / 2; ++i) {
if(n % i == 0) {
isPrime = false;
break;
}
}
if (isPrime) {
cout << "This is a prime number";} else {cout << "This is not a prime number";}
return 0;}
🤖 Code Explanation
This is a program that determines whether or not a number entered by the user is prime. A prime number is a positive integer that has no positive integer divisors other than 1 and itself.

More problems solved in C++




















