Submission #20943325

---

Source Code Expand

import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    @SuppressWarnings("resource")
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    long[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47 };
    HashSet<Long> set = new HashSet<Long>();

    long[] a = new long[n];
    for (int i = 0; i < n; i++) {
      a[i] = sc.nextLong();
    }

    Arrays.sort(a);

    for (int j = 0; j < primes.length; j++) {
      if ((a[0] % primes[j]) == 0) {
        set.add(primes[j]);
        break;
      }
    }

    for (int i = 1; i < n; i++) {
      boolean add = false;
      for (long tmp : set) {
        if ((a[i] % tmp) == 0) {
          add = true;
          break;
        }
      }

      if (!add) {
        for (int j = 0; j < primes.length; j++) {
          if (((a[i] % primes[j]) == 0) && !set.contains(primes[j])) {
            set.add(primes[j]);
            break;
          }
        }
      }
    }

    long ans = 1;
    for (long t : set) {
      ans *= t;
    }

    System.out.println(ans);
  }
}

Submission Info

Judge Result