Count Of Subarrays With Sum Divisible By K

easy
Question Solve Solutions 
1. You are given an array of integers(arr) and a number K.
2. You have to find the count of subarrays whose sum is divisible by K.

Input Format

A number N arr1 arr2.. N numbers A number K

Output Format

A number representing the count of subarrays whose sum is divisible by K.

Constraints

1 <= N,K <= 10^5
-1000 <= arr[i] <= 1000

Example

Input
6
2 7 6 1 4 5
3
Output
5
Previous
Group Shifted String
Next
Longest Subarray With Equal Number Of Zeroes And Ones

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String