Description:
Write a program that takes an integer and prints out all ways to multiply smaller integers that equal the original number, without repeating sets of factors. In other words, if your output contains 4x3, you should not print out 3x4 again as that would be a repeating set. Note that this is not asking for prime factorization only. Also, you can assume that the input integers are reasonable in size; correctness is more important than effciency
Requirements:
Lang:C++/Java Running time:1s Memory:32M
# | input | expected output | actual output | is passed |
---|---|---|---|---|
1 | Mark | Otto | @mdo | false |
2 | Try coding anddebugging by yourself! You have two options: 1. TYPE your code here, 2. or click on [Attach] button to UPLOAD a local file. Note: the existing code will be replaced by the content uploaded! | @fat | @fat | true |
3 | Mike | @m | @m | true |
Summary | 2 of 3 test cases passed |