http://projecteuler.net/index.php?section=problems&id=3

"The prime factors of 13195 are 5, 7, 13 and 29.

What is the largest prime factor of the number 600851475143 ?"

--

Just one quick question, I'm already sure this is the wrong approach so I'm researching the right way to do it in C++, but, this has me wondering. Is this a safe-check? That is, will y/2 end up being the exact value (a decimal, compared to an int which I assume it would just drop the 1.5 value to 1?) I would try running it but well it has to loop through 30 million times and my computer isn'tCode:unsigned long long int y = 600851475143; // wow thats long for ( int i = 0; i<(y/2); ++i) { std::cout << "Check " << i << "\n"; }thatfast