From 628475fdb73a141863d8fc81a9db41fbf3d1034b Mon Sep 17 00:00:00 2001
From: chayan das <dasshuvo817@gmail.com>
Date: Thu, 17 Apr 2025 15:33:13 +0530
Subject: [PATCH] Create 2176. Count Equal and Divisible Pairs in an Array

---
 2176. Count Equal and Divisible Pairs in an Array | 14 ++++++++++++++
 1 file changed, 14 insertions(+)
 create mode 100644 2176. Count Equal and Divisible Pairs in an Array

diff --git a/2176. Count Equal and Divisible Pairs in an Array b/2176. Count Equal and Divisible Pairs in an Array
new file mode 100644
index 0000000..31514f8
--- /dev/null
+++ b/2176. Count Equal and Divisible Pairs in an Array	
@@ -0,0 +1,14 @@
+class Solution {
+public:
+    int countPairs(vector<int>& nums, int k) {
+        int ans = 0;
+        for (int i = 0; i < nums.size(); i++) {
+            for (int j = i + 1; j < nums.size(); j++) {
+                if (nums[i] == nums[j] && (i * j) % k == 0) {
+                    ans++;
+                }
+            }
+        }
+        return ans;
+    }
+};