From c220562e174f7332da186a1228ede7ad87538322 Mon Sep 17 00:00:00 2001
From: Moksh Gupta <mokshgupta567@gmail.com>
Date: Mon, 3 Oct 2022 02:36:29 +0530
Subject: [PATCH] add 2427. Number of Common Factors

---
 .../2427-Number-of-Common-Factors.cpp         | 18 +++++++++++
 2427-Number-of-Common-Factors/NOTES.md        |  0
 2427-Number-of-Common-Factors/README.md       | 30 +++++++++++++++++++
 3 files changed, 48 insertions(+)
 create mode 100644 2427-Number-of-Common-Factors/2427-Number-of-Common-Factors.cpp
 create mode 100644 2427-Number-of-Common-Factors/NOTES.md
 create mode 100644 2427-Number-of-Common-Factors/README.md

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 @@
+<h2><a href="https://leetcode.com/problems/number-of-common-factors/">2427. Number of Common Factors</a></h2><h3>Easy</h3><hr><div><p>Given two positive integers <code>a</code>&nbsp; and <code>b</code>&nbsp;, return the number of <b><em>common</em></b> factors of <code>a</code>&nbsp; and <code>b</code>&nbsp;.
+
+<p>An integer <code>x</code>&nbsp; is a <b>common factor</b> of <code>a</code>&nbsp; and <code>b</code>&nbsp; if <code>x</code>&nbsp;
+divides both <code>a</code>&nbsp; and <code>b</code>&nbsp;.
+
+
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre><strong>Input:</strong> a = 12, b = 6
+<strong>Output:</strong> 4
+<strong>Explanation:</strong> The common factors of 12 and 6 are 1, 2, 3, 6.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre><strong>Input:</strong> a = 25, b = 30
+<strong>Output:</strong> 2
+<strong>Explanation:</strong> The common factors of 25 and 30 are 1, 5.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= a, b &lt;= 1000</code></li>
+</ul>
+
+</div>
\ No newline at end of file