feat: add solutions to lc problem: No.2176

No.2176.Count Equal and Divisible Pairs in an Array

Author: YangFong

solution/2100-2199/2176.Count Equal and Divisible Pairs in an Array/README.md

@@ -120,7 +120,54 @@ func countPairs(nums []int, k int) int {
 ### **TypeScript**
 
 ```ts
+function countPairs(nums: number[], k: number): number {
+    const n = nums.length;
+    let ans = 0;
+    for (let i = 0; i < n - 1; i++) {
+        for (let j = i + 1; j < n; j++) {
+            if (nums[i] === nums[j] && (i * j) % k === 0) {
+                ans++;
+            }
+        }
+    }
+    return ans;
+}
+```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn count_pairs(nums: Vec<i32>, k: i32) -> i32 {
+        let k = k as usize;
+        let n = nums.len();
+        let mut ans = 0;
+        for i in 0..n - 1 {
+            for j in i + 1..n {
+                if nums[i] == nums[j] && i * j % k == 0 {
+                    ans += 1;
+                }
+            }
+        }
+        ans
+    }
+}
+```
+
+### **C**
+
+```c
+int countPairs(int *nums, int numsSize, int k) {
+    int ans = 0;
+    for (int i = 0; i < numsSize - 1; i++) {
+        for (int j = i + 1; j < numsSize; j++) {
+            if (nums[i] == nums[j] && i * j % k == 0) {
+                ans++;
+            }
+        }
+    }
+    return ans;
+}
 ```
 
 ### **...**

solution/2100-2199/2176.Count Equal and Divisible Pairs in an Array/README_EN.md

@@ -110,7 +110,54 @@ func countPairs(nums []int, k int) int {
 ### **TypeScript**
 
 ```ts
+function countPairs(nums: number[], k: number): number {
+    const n = nums.length;
+    let ans = 0;
+    for (let i = 0; i < n - 1; i++) {
+        for (let j = i + 1; j < n; j++) {
+            if (nums[i] === nums[j] && (i * j) % k === 0) {
+                ans++;
+            }
+        }
+    }
+    return ans;
+}
+```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn count_pairs(nums: Vec<i32>, k: i32) -> i32 {
+        let k = k as usize;
+        let n = nums.len();
+        let mut ans = 0;
+        for i in 0..n - 1 {
+            for j in i + 1..n {
+                if nums[i] == nums[j] && i * j % k == 0 {
+                    ans += 1;
+                }
+            }
+        }
+        ans
+    }
+}
+```
+
+### **C**
+
+```c
+int countPairs(int *nums, int numsSize, int k) {
+    int ans = 0;
+    for (int i = 0; i < numsSize - 1; i++) {
+        for (int j = i + 1; j < numsSize; j++) {
+            if (nums[i] == nums[j] && i * j % k == 0) {
+                ans++;
+            }
+        }
+    }
+    return ans;
+}
 ```
 
 ### **...**

solution/2100-2199/2176.Count Equal and Divisible Pairs in an Array/Solution.c

@@ -0,0 +1,11 @@
+int countPairs(int *nums, int numsSize, int k) {
+    int ans = 0;
+    for (int i = 0; i < numsSize - 1; i++) {
+        for (int j = i + 1; j < numsSize; j++) {
+            if (nums[i] == nums[j] && i * j % k == 0) {
+                ans++;
+            }
+        }
+    }
+    return ans;
+}

solution/2100-2199/2176.Count Equal and Divisible Pairs in an Array/Solution.rs

@@ -0,0 +1,15 @@
+impl Solution {
+    pub fn count_pairs(nums: Vec<i32>, k: i32) -> i32 {
+        let k = k as usize;
+        let n = nums.len();
+        let mut ans = 0;
+        for i in 0..n - 1 {
+            for j in i + 1..n {
+                if nums[i] == nums[j] && i * j % k == 0 {
+                    ans += 1;
+                }
+            }
+        }
+        ans
+    }
+}

solution/2100-2199/2176.Count Equal and Divisible Pairs in an Array/Solution.ts

@@ -0,0 +1,12 @@
+function countPairs(nums: number[], k: number): number {
+    const n = nums.length;
+    let ans = 0;
+    for (let i = 0; i < n - 1; i++) {
+        for (let j = i + 1; j < n; j++) {
+            if (nums[i] === nums[j] && (i * j) % k === 0) {
+                ans++;
+            }
+        }
+    }
+    return ans;
+}