Hi there, I am new in this forum, so please help me with your suggestions.. Earlier today I was trying to solve the problem under "Practice>Beginner" named "Minimum Deletion" tag:RD19 I know it's a smart way to solve this by finding GCD of the numbers but I tried something else. The GCD of the numbers suppose to be 1 if all of them are PRIME numbers, so we just wanna know how many numbers are not prime in the given nembers.. So I write the code which is looking fine to me but after submission it says "Wrong answer" I will appreciate if someone help me to find the bug in my code...
asked 12 Jun '18, 22:01

Consider the test case 6, 8, 9 the answer should be 0 as you don’t need to delete any numbers to achieve a GCD of 1 altogether. So this is the case of all numbers being Coprime. answered 13 Jun '18, 21:36
