[NOIP2012 Popularization Group] Prime factor decomposition

Topic link

Title Description
Knowing that the positive integer n is the product of two different prime numbers, try to find the larger prime number of the two.

Input format
A positive integer n.

Output format
A positive integer p, which is the larger prime number.

Code:

#include<iostream>
using namespace std;
bool is_prime(int n)
{
    
    
	for(int i = 2; i * i <= n; i++)
		if(n % i == 0) return false;
	return n != 1;
}
int main()
{
    
    
	int n;
	cin >> n;
	for(int i = 2; i <= n; i++)
		if(is_prime(i) && n % i == 0 && is_prime(n / i) && n % i != i)
		{
    
    
			cout << n / i;
			break;
		}
	return 0;
}