1
use std::collections::HashMap;
2

3
impl Solution {
4
  fn gcd(mut a: i32, mut b: i32) -> i32 {
5
    while b > 0 {
6
      let tmp = a;
7
      a = b;
8
      b = tmp % b;
9
    }
10
    return a;
11
  }
12

13
  pub fn has_groups_size_x(deck: Vec<i32>) -> bool {
14
    let mut data = HashMap::new();
15
    for v in deck {
16
      *data.entry(v).or_insert(0) += 1;
17
    }
18

19
    let mut val = 0;
20
    for (_, v) in data {
21
      val = Self::gcd(v, val);
22
    }
23
    return val > 1;
24
  }
25
}