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
|
pushkar:
2014-08-21 10:00:32
can anyone suggest some input.. My program is failing for judge 4. |
|
Harry Mathis:
2014-08-09 14:04:53
Same algorithmn is getting TLE in Java but AC in C++ |
|
||N0VICE||:
2014-03-29 18:10:28
Nice prob
|
|
Ramesh Kumar Katreddi:
2014-03-07 23:55:21
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 :) |
|
Himanshu:
2014-02-06 15:12:20
AC after 21 TLE,RE,CE 15.?? sec.. |
|
Mukund Kumar:
2014-01-09 17:29:29
Learnt something new :) |
|
[Lakshman]:
2013-12-30 07:12:29
@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.
|
|
tend:
2013-12-30 06:34:49
@Lakshman there is time limit of 6s but many solutions have been accepted previously in even 22s. |
|
|
[Lakshman]:
2013-12-29 16:32:48
@tend which previous time limit you are talking about. |
|
|
tend:
2013-12-29 15:44:04
why time limit has been reduced from previous one !! |
| Added by: | Phyllipe Medeiros |
| Date: | 2012-02-26 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
RSS