rival_R's blog

By rival_R, history, 15 months ago, In English

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.

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it