Project Euler : problem 3

question:

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

What is the largest prime factor of the number 600851475143 ?

solution:

#include<stdio.h>
int main () {

_int64 number, large_factor=0, i=2;

printf ("Enter a number : ");
scanf ("%I64d", &number);

while (number!=1) {

    if (number%i==0) {

        while (number%i==0) {
            printf ("%I64d\t", i);
            number/=i;
        }

        large_factor=i;
    }

    i++;
 }

printf ("\n\nThe largest prime factor is : %I64d\n\n", large_factor);

return 0;
}

注：long long int 是VC99中添加的，在VC6.0中编译会出错，故使用的是：

_int64