Unable to solve this question

Revision en1, by pratikshaw, 2023-07-14 10:18:02

You are given an array of size n, consisting of non negative integers. Find the number of subarrays of arr which are special. A subarray is special if it satisfies the following condition: The product of the maximum and the minimum element of the subarray is divisible by the length of the subarray. Find the number of special subarrays of the array.

1<=n<=1e5

Tags help, unsolved

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English pratikshaw 2023-07-14 10:18:02 401 Initial revision (published)