please help me with this question

Revision en1, by rival_R, 2022-06-23 13:22:46

Given an array of integers.find total number of ways to pick two elements say(ai,aj) such that gcd(ai,aj) is not prime. Note: choosing ai,aj is same as choosing aj,ai;

*please suggest solution other that bruteforce.


  Rev. Lang. By When Δ Comment
en1 English rival_R 2022-06-23 13:22:46 252 Initial revision (published)