质因数:
1 for (i = 2; i*i <= p; i++) 2 { 3 while (p%i == 0) 4 { 5 l[c++] = i; 6 p /= i; 7 } 8 }
质数:
1 for (int i = 2;i <= N;i ++) 2 { 3 if (!check[i]) 4 { 5 prime[pos ++] = i; 6 for (int j = i;j <= N;j += i) 7 check[j] = 1; 8 } 9 }
因数:
1 for(int i=1;i<=cnt;i++) 2 { 3 if(m%prime[i]==0) //这个质数prime[i]是因数 4 ...... 5 while(m%prime[i]==0) 6 { 7 m/=prime[i]; 8 } 9 }