Smallest Excluded LCM SOLUTION CODECHEF

[SOLUTION] Smallest Excluded LCM SOLUTION CODECHEF

by

Problem SOLUTION CODECHEF You are given an array �A containing �N integers. Find the smallest integer �x that doesn’t occur as the LCM of some subsequence of �A. The LCM (lowest common multiple) of a set of integers is the smallest positive integer that is a multiple of them all. For example, LCM(2,3)=6,LCM(4,5,8,1)=40,LCM(13)=13LCM(2,3)=6,LCM(4,5,8,1)=40,LCM(13)=13. Input Format The first line of input will contain a single integer �T, denoting the … Read more