C程式用來求出一個數的最大質因子

Prime Factor− In number theory, the prime factors of a positive integer are the prime numbers that divide that integer exactly. The process of finding these numbers is called integer factorization, or prime factorization.

Example− Prime factors of 288 are: 288 = 2 x 2 x 2 x 2 x 2 x 3 x 3

Input: n = 124
Output: 31 is the largest prime factor!

##Explanation

您將找到一個數字的所有質因數，並找出其中最大的質因數。 124的質因數為2 x 2 x 31，其中31為最大的質因數。

Example

#include <stdio.h>
int main() {
   long int n;
   n=3453;
   long int div=2, ans = 0, maxFact;
   while(n!=0) {
      if(n % div !=0)
         div = div + 1;
      else {
         maxFact = n;
         n = n / div;
         if(n == 1) {
            printf("%d is the largest prime factor !",maxFact);
            ans = 1;
            break;
         }
      }
   }
   return 0;
}

輸出

1151 is the largest prime factor !

以上是C程式用來求出一個數的最大質因子的詳細內容。更多資訊請關注PHP中文網其他相關文章！