count increasing subsequence in O(n) -> OA Problem

Правка en4, от i_am_not_special, 2024-08-08 17:19:56

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.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский i_am_not_special 2024-08-08 17:19:56 19
en3 Английский i_am_not_special 2024-08-08 10:38:39 4
en2 Английский i_am_not_special 2024-08-08 10:35:06 2
en1 Английский i_am_not_special 2024-08-08 10:30:34 239 Initial revision (published)