Feedback for STRNG problem

Learning course: Number theory
Problem Link: CodeChef: Practical coding for everyone


Incorrect Hint 4.1: “If the gcd of the array is 1 and
2 or more of its elements are prime, then there cannot be any strong elements in the array.”

This is incorrect. Example: [3, 5, 15] has GCD=1, Number of primes=2, Strong elements = 2 (3 and 5 both will be strong)

Correction will be “…3 or more…” {simple but should be corrected anyway}

yes u are right .