Top Questions

1. I can't solve a problem that related to prime power modulo 1e9+7. I think to solve this problem , we must use Constructive Algorithm
   6 votes

   1 answers
2. Count the number of ranges [L; R] which has difference between the maximum and minimum is even
   5 votes

   1 answers
3. Maximum k such that A[0]<A[k], A[1]<A[k+1], ..., A[k-1]<A[2*k-1], after sorting each k-sized window
   2 votes

   1 answers
4. Efficient way to find min(max(A[L], A[L+1],...,A[R]), min(B[L], B[L+1],…, B[R]))
   2 votes

   2 answers