Skip to content
On this page

2427. Number of Common Factors share

Problem Statement

Given two positive integers a and b, return the number of common factors of a and b.

An integer x is a common factor of a and b if x divides both a and b.

Β 

Example 1:

Input: a = 12, b = 6
Output: 4
Explanation: The common factors of 12 and 6 are 1, 2, 3, 6.

Example 2:

Input: a = 25, b = 30
Output: 2
Explanation: The common factors of 25 and 30 are 1, 5.

Β 

Constraints:

  • 1 <= a, b <= 1000
Click to open Hints
  • For each integer in range [1,1000], check if it’s divisible by both A and B.

Solution:

rs
impl Solution {
    pub fn common_factors(a: i32, b: i32) -> i32 {
        let mut count = 0;
        let limit = i32::min(a, b);

        for i in 1..=limit {
            if a % i == 0 && b % i == 0 {
                count += 1;
            }
        }

        count
    }
}

...


Released under the MIT License.