D. Number into Sequence (codeforces round #686)

D. Number into Sequence

You are given an integer n (n>1).

Your task is to find a sequence of integers a1,a2,…,ak such that:

each ai is strictly greater than 1;
a1⋅a2⋅…⋅ak=n (i. e. the product of this sequence is n);
ai+1 is divisible by ai for each i from 1 to k−1;
k is the maximum possible (i. e. the length of this sequence is the maximum possible).
If there are several such sequences, any of them is acceptable. It can be proven that at least one valid sequence always exists for any integer n>1.

You have to answer t independent test cases.

input

The first line of the input contains one integer t (1≤t≤5000) — the number of test cases. Then t test cases follow.

The only line of the test case contains one integer n (2≤n≤1010).

It is guaranteed that the sum of n does not exceed 1010 (∑n≤1010).

output

For each test case, print the answer: in the first line, print one positive integer k — the maximum possible length of a. In the second line, print k integers a1,a2,…,ak — the sequence of length k satisfying the conditions from the problem statement.

If there are several answers, you can print any. It can be proven that at least one valid sequence always exists for any integer n>1.

example

input
4
2
360
4999999937
4998207083

output
1
2
3
2 2 90
1
4999999937
1
4998207083

思路：求出1-100000里的素数，对于每一个输入，判断能否被这范围内的素数整除，若能输入就是素数，若不能，用输入不停除以那能被整除的素数，直到不符合第3个条件，每一个能被整除的素数都要考虑，找出除的次数最多的那个，次数便是k,ai…ak-1,便是那素数，ak便是输入除完后的数。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int tot=0;
int prime[100005]={0};
bool vis[100005];
void is_prime(int x)
{
    memset(vis,true,sizeof(vis));
    vis[1]=false;
    for(int i=2;i<=x;i++){
        if(vis[i]) 
		prime[++tot]=i;
        for(int j=1;j<=x&&i*prime[j]<=x;j++){
           vis[i*prime[j]]=false;
           if(i%prime[j]==0) 
		   break;
        }
    }
}
int main(){
	int t;
	cin>>t;
	is_prime(100000);
	for(int i=1;i<=t;i++){
		ll b;
		scanf("%lld",&b);
		if(b<=100000){
			if(vis[b]){
				printf("1\n");
			printf("%d\n",b);
			continue;
		}
		}
		queue<ll>que;
		int ans=0;
		int maxx=0;
		int e;
		for(int j=1;j<=tot;j++){
			int o=prime[j];
			ans=0;
			if(b%o==0){
				ll q=b;
				while(q%o==0){
					q=q/o;
					ans++;
				}
				if(ans>maxx){
				maxx=ans;
				e=o;
			}
			}
		}
		if(maxx==0){
			printf("1\n");
			printf("%lld\n",b);
		}
		else{
		printf("%d\n",maxx);
		while(b%e==0){
			b=b/e;
			if(b%e==0)
			{
				printf("%d ",e);
			}
		}
		printf("%lld ", b*e);
		printf("\n");
	}
	}
}