Sphere Online Judge

SPOJ Problem Set (classical)

10818. Medium Factorization

Problem code: FACTCG2


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

Sample Output

1
1 x 2
1 x 2 x 2
1 x 2 x 2 x 2

Added by:Phyllipe Medeiros
Date:2012-02-26
Time limit:6s
Source limit:50000B
Memory limit:256MB
Cluster: Pyramid (Intel Pentium III 733 MHz)
Languages:All

hide comments
2014-09-18 00:05:18 Baojun Wang
same algorithm, C++ passed, Haskell version TLE, even haskell version is almost the same on my machine. Time to upgrade haskell compiler on SPOJ?

Last edit: 2014-09-18 00:24:41
2014-08-21 10:00:32 pushkar
can anyone suggest some input.. My program is failing for judge 4.
2014-08-09 14:04:53 Harry Mathis
Same algorithmn is getting TLE in Java but AC in C++
2014-06-07 11:20:35 Linghui Liu
21.33s is AC!!
2014-05-08 17:33:16 is_jas


Last edit: 2014-09-13 21:03:20
2014-03-29 18:10:28 ||N0VICE||
Nice prob
was getting WA because of printing an extra 1 at the end of stdin
2014-03-07 23:55:21 Ramesh Kumar Katreddi
Input Specification needs to be proper. the x is small and needs one space on either side. and in the example it actually looks like capital X. Lot of TLE's. but finally ac :)
2014-02-06 15:12:20 Himanshu Sahu
AC after 21 TLE,RE,CE 15.?? sec..
2014-01-09 17:29:29 Mukund Kumar
Learnt something new :)
2013-12-30 07:12:29 [Lakshman]
@tend The time limit was never 22 second. The input file have multiple test cases , and the running time u are talking about us sum of running time of all test files.
click on all submission and check my today submission and it took 17s

Last edit: 2013-12-30 07:18:49
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.