LeetCode in Kotlin

2427. Number of Common Factors

Easy

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:

Solution

class Solution {
    fun commonFactors(a: Int, b: Int): Int {
        var ans = 0
        for (i in 1..a.coerceAtMost(b)) {
            if (a % i == 0 && b % i == 0) {
                ans++
            }
        }
        return ans
    }
}
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy