代码中的 i*i 的意思是当i*i>50000时，此时第二个 j 已经把所有的 i 的取值取过了，所以不需要进行多余的计算了，也可和以前一样，写一个判断是否是素数的函数，把2~50000都循环一边。总结：这道题目没太看懂题目，看懂了之后发现还不算难，需要先把所有的素数存储在数组中，然后找到能被正整数N相除且是质数的数，如果该数满足条件还要判断当前数是否能再次满足条件。好好学习，天天向上！
1059 Prime Factors
Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p1k1×p2k2×⋯×pmkm.
Input Specification:
Each input file contains one test case which gives a positive integer N in the range of long int.
Output Specification:
Factor N in the format N = p1^k1*p2^k2*…*pm^km, where pi's are prime factors of N in increasing order, and the exponent ki is the number of pi -- hence when there is only one pi, ki is 1 and must NOT be printed out.
Sample Input:
97532468
Sample Output:
97532468=2^2*11*17*101*1291总结：这道题目没太看懂题目，看懂了之后发现还不算难，需要先把所有的
最低0.47元/天 解锁文章
91
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
