Self Made Problem help.

Правка en1, от iez, 2025-06-18 20:09:37

You have an array of n numbers and an integer x, find the biggest subarray so that its Product is not dividable to x and n is up to 1e5

I also have a similar question for the biggest array so that their sum is not dividable to x

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский iez 2025-06-18 20:09:37 258 Initial revision (published)