cho.shresearchmini
ProblemCode
Description
Time limit
Memory limit
cho.shTime limit
Memory limit
A positive integer A is a proper divisor of N if N is a multiple of A and A is neither 1 nor N.
Given all proper divisors of some number N, find N.
The first line contains M, the number of proper divisors. M is a positive integer no greater than 50.
The second line contains the M proper divisors of N. Each divisor is a distinct positive integer between 2 and 1,000,000, inclusive.
Print N on the first line. N can always be represented as a 32-bit signed integer.