挑战
给定正整数输入n (n>1),计算n的唯一因式分解数组,不包括1。秩序并不重要。
2 => [[2]]
3 => [[3]]
4 => [[4],[2,2]]
5 => [[5]]
6 => [[6],[2,3]]
7 => [[7]]
8 => [[8],[2,2,2],[2,4]]
9 => [[9],[3,3]]
10 => [[10],[2,5]]
11 => [[11]]
12 => [[12],[3,4],[3,2,2],[2,6]]这是密码-高尔夫,所以最低字节数获胜!
https://codegolf.stackexchange.com/questions/139723
复制相似问题