diff --git a/2427-Number-of-Common-Factors/2427-Number-of-Common-Factors.cpp b/2427-Number-of-Common-Factors/2427-Number-of-Common-Factors.cpp new file mode 100644 index 0000000..76046b0 --- /dev/null +++ b/2427-Number-of-Common-Factors/2427-Number-of-Common-Factors.cpp @@ -0,0 +1,18 @@ +class Solution +{ +public: + int commonFactors(int a, int b) + { + int ans=0; + // find the max(a,b) + //iterating over the input + for(int i = 1 ; i <= max(a,b);i++){ + //Check condition if a modulus i equal to 0 and b modulus i equal to 0 ans++ + if(a%i==0 && b%i==0){ + ans++; + } + } + // returning the ans + return ans; + } +}; \ No newline at end of file diff --git a/2427-Number-of-Common-Factors/NOTES.md b/2427-Number-of-Common-Factors/NOTES.md new file mode 100644 index 0000000..e69de29 diff --git a/2427-Number-of-Common-Factors/README.md b/2427-Number-of-Common-Factors/README.md new file mode 100644 index 0000000..18ded3f --- /dev/null +++ b/2427-Number-of-Common-Factors/README.md @@ -0,0 +1,30 @@ +

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:

+ + + +
\ No newline at end of file