| Submit | All submissions | Best solutions | Back to list |
EIPRIFACTOR - Prime factors |
Every positive integer can represent the product of primes. Prime factorization or integer factorization of a number is breaking a number down into the set of prime numbers which multiply together to result in the original number. This is also known as prime decomposition. Implement prime factorization and output the exponent of each prime factors in number N.
Input
The only integer (N<=10^9).
Output
Each line contains its respective prime and exponent divisors. The prime factors are exported in ascending order.
Example
Input: 12 Output: 2 2
3 1
| Added by: | Ha Minh Ngoc |
| Date: | 2017-10-29 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | CSHARP C++ 4.3.2 CPP CPP14 CPP14-CLANG FSHARP GO JAVA JS-MONKEY NODEJS PHP PYTHON PYPY PYPY3 PYTHON3 RUBY SQLITE SWIFT VB.NET |
RSS