Largest prime factor

euler_3.cpp

#include "stdafx.h"
#include <iostream>
using namespace std;
void main()
{
	long int factor = 600851475143;
	for (long int divider = 2; divider < factor; divider++)
	{
		(factor % divider == 0) ? factor /= divider, divider = 2 : NULL;
	}
	cout << factor << endl;
	system("pause");
}