ZOJ1823 UVA10392 Factoring Large Numbers【因子】

One of the central ideas behind much cryptography is that factoring large numbers is computationally intensive. In this context one might use a 100 digit number that was a product of two 50 digit prime numbers. Even with the fastest projected computers this factorization will take hundreds of years.
You don’t have those computers available, but if you are clever you can still factor fairly large numbers.
Input
The input will be a sequence of integer values, one per line, terminated by a negative number. The numbers will fit in gcc’s long long int datatype, however scanf and printf do not appear to handle this datatype correctly, so you must do your own I/O conversion.
Output
Each positive number from the input must be factored and all factors (other than 1) printed out. The factors must be printed in ascending order with 4 leading spaces preceding a left justified number, and
followed by a single blank line.
Sample Input
90
1234567891
18991325453139
12745267386521023
-1
Sample Output
    2
    3
    3
    5

    1234567891

    3
    3
    13
    179
    271
    1381
    2423
    30971
    411522630413

问题链接：ZOJ1823 UVA10392 Factoring Large Numbers
问题简述：（略）
问题分析：
    简单题，给定一个数，计算其因子并且输出。因子超过1000000时，只需输出一下原数。
    ZOJ与UVA只是输出数据格式略有不同，没有前导的空格。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++语言程序(ZOJ)如下：

/* ZOJ1823 Factoring Large Numbers */

#include <iostream>

using namespace std;

const int N = 1000000;

int main()
{
    long long n;
    while(~scanf("%lld", &n) && n > 0) {
        int i;
        for(i = 2; i <= n && i <= N; i++)
            while(n % i == 0) {
                n /= i;
                printf("%d\n", i);
            }
        if(i > N) printf("%lld\n", n);
        printf("\n");
    }

    return 0;
}

AC的C++语言程序(UVA)如下：

/* UVA10392 Factoring Large Numbers */

#include <iostream>

using namespace std;

const int N = 1000000;

int main()
{
    long long n;
    while(~scanf("%lld", &n) && n > 0) {
        int i;
        for(i = 2; i <= n && i <= N; i++)
            while(n % i == 0) {
                n /= i;
                printf("    %d\n", i);
            }
        if(i > N) printf("    %lld\n", n);
        printf("\n");
    }

    return 0;
}