FACTCG2  Medium Factorization
The task in this problem is to write a number in a multiplication of prime numbers separated by “ x ”. You need to put the number 1 in this multiplication.
Input
The input consists of several lines.
Each line consists of one integer N (1 <= N <= 10^7) .
Output
For each line you need to output the factorization separated by “ x ” and including 1.
Sample
Input 1 2 4 8 Output 1 1 x 2 1 x 2 x 2 1 x 2 x 2 x 2
hide comments
aditya930:
20170202 22:17:10
nice problem....use sieve....!!!! 

sandeepg97:
20161210 12:27:34
@yash Sharma...you made my day!!!


sushantoberoi3:
20160825 18:16:54
use printf/scanf...cin/cout> tle


ritik_001:
20160809 15:11:23
AC after 6 WA(s).. that extra space costed me a lot. ;( 

aspro:
20160602 14:15:11
very good question .... optimise the sieve as much as possible... 

shikhar0037:
20160127 16:06:25
use scanf and printf .Also print solution in ascending order only. 

darkhire21:
20160115 15:24:12
learned new thing , nice problem . 

darkhire21:
20160115 15:15:03
changing X to x accepted . 

hassangarh:
20160113 17:43:41
after so many tle finally!!!


Himanshu Bansal:
20160111 22:24:50
nice qus...learned a lot.......!! 
Added by:  Phyllipe Medeiros 
Date:  20120226 
Time limit:  0.517s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 