organizator

#include <iostream>
#include <set>
#include <map>
#define S second
#define F first
using namespace std;
int N;

int a[2111333];


int p[2111333];


map<int, int> tkj;


set<int> ctkj;
void h(int c){
  ctkj.clear();
  ctkj.insert(c);
  int w=c;
  
  while (p[w]!=w){
    for (int i=p[w]; i<c; i+=p[w]){
      if (c%i==0)ctkj.insert(i);
    }
    w/=p[w];
  }
  for (auto a:ctkj){
    ++tkj[a];
  }
}

long long ans=2;
int main(){
  p[0]=p[1]=1;
  for (int i=2; i<2111333; ++i){
    if (p[i]) continue;
    p[i]=i;
    for (int j=i+i; j<2111333; j+=i){
      p[j]=i;
    }
  }
  cin >> N;
  for (int i=0; i<N; ++i){
    int w;
    cin >> w;
    h(w);
  }
  
  for (auto a:tkj){
    if (a.S>1) ans=max(ans, (long long)a.F*a.S);
  }
  cout << ans << "\n";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: TIME LIMIT EXCEEDED

Test 16

Verdict: TIME LIMIT EXCEEDED

Test 17

Verdict: TIME LIMIT EXCEEDED

Test 18

Verdict: TIME LIMIT EXCEEDED

Test 19

Verdict: TIME LIMIT EXCEEDED