【PAT】A1059 Prime Factors【素因子分解】【欧拉筛法】

Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p​1​​​^{k​1​​​​×p​2}​​​k​2​​​​×⋯×p​m​​​^k​m​​​​.

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 = p​1​​^{k​1​​*p​2​​}k​2​​*…*p​m​​^k​m​​, where p​i​​’s are prime factors of N in increasing order, and the exponent k​i​​ is the number of p​i​​ – hence when there is only one p​i​​, k​i​​ is 1 and must NOT be printed out.

Sample Input:

97532468

Sample Output:

97532468=2^211171011291

题意

求一个数字的素因子分解。

思路

先用欧拉筛法打表，然后依次查询。

代码

#include <iostream>
#include <cmath>
#define MAX_N 100000
bool marked[(MAX_N) + 1] = {
   false};
long prime[(MAX_N) + 1], cnt = 0;
// 欧拉筛法打表
void euler(){