i_am_not_special's blog

By i_am_not_special, history, 5 hours ago, In English

So the question is count the number of increasing subsequence such that the gcd of subsequence will be equal to 1.

1 <= size of array <= 1e5 1 <= a[i] <= 1e6

can anyone help me solve this problem.

Full text and comments »

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