Cody

Problem 44699. Prime Product

My professor has given a sequence of N numbers as a1, a2, ..., aN and asked me to find the smallest possible value of ai * aj such that it is a prime number, where 1 <= i < j <= N.

If it's possible to find any value of ai * aj such that it is a prime number, then print the smallest value of such ai * aj, otherwise print -1.

x=[1 2 3]
y = 2
x=[5 5 5 2]
y = -1

Solution Stats

48.57% Correct | 51.43% Incorrect
Last solution submitted on Feb 25, 2019

Problem Recent Solvers15

Suggested Problems

More from this Author2

Problem Tags