One of the central idea 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.

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.

······

大數求因子的題，本來以為會超時，結果也沒有，通過這道題堅信了自己平常使用的求因子、質數的方法還是蠻快的嘛。水題上程式碼不多說。

#include <stdio.h>
using namespace std;
int main(){
    long long num;
    while(~scanf("%lld",&num) && num!=-1){
        for(long long i=2;i*i<=num;i++)
            while(!(num%i)){
                num/=i;
                printf
 
("    %lld\n",i);
            }
        if(num>1)
            printf("    %lld\n",num);
        printf("\n");
    }
}