title: Subsequences Size Three Array Whose Sum Divisible M
signature: func subsequencesSizeThreeArrayWhoseSumDivisibleM(a []int, n int, m int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(a []int, n int, m int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(a, n, m),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver([]int{14, 35, 56, 70, 88}, 
  	3, 
  	4, 0)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver([]int{-50, -92, 16, -68, -36}, 
  	3, 
  	4, 0)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver([]int{0, 0, 0, 1, 1, 1}, 
  	4, 
  	5, 1)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver([]int{76, 43, 22, 41, 49, 99, 25, 40, 3, 45, 60, 16, 83, 62, 26, 93, 64, 73, 72, 53, 6, 32, 35, 67, 17}, 
  	14, 
  	21, 19)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver([]int{-90, -86, -86, -66, -50, -48, -44, -42, -42, -38, -24, -22, -20, -18, -8, 8, 24, 28, 34, 48, 60, 62, 66, 68, 74, 76, 80, 82, 88}, 
  	24, 
  	20, 207)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver([]int{1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0}, 
  	24, 
  	30, 120)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver([]int{4, 5, 8, 9, 10, 12, 13, 16, 17, 18, 21, 21, 25, 27, 28, 30, 36, 36, 54, 55, 56, 57, 60, 62, 67, 67, 68, 71, 72, 72, 73, 73, 77, 77, 83, 86, 86, 86, 87, 89, 92, 92, 96, 97, 97, 98}, 
  	24, 
  	23, 85)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver([]int{-64, 52, -32, 38, 8, -62, -56, 20, 72, -12, 32, 44}, 
  	6, 
  	6, 2)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 
  	12, 
  	15, 220)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver([]int{77, 68, 45, 6, 27, 19, 29, 95, 21, 2, 39, 48, 72, 67, 49, 45, 1, 16, 56, 78, 25, 22, 27, 40, 31, 34, 26, 35, 12}, 
  	25, 
  	25, 92)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def subsequences_size_three_array_whose_sum_divisible_m(A, N, M):
      sum = 0
      ans = 0
      for i in range(0, N):
          for j in range((i + 1), N):
              for k in range((j + 1), N):
                  sum = ((A[i] + A[j]) + A[k])
                  if ((sum % M) == 0):
                      ans = (ans + 1)
      return ans
source_cpp: int subsequences_size_three_array_whose_sum_divisible_m(vector<int> A, int N, int M) {
    int sum = 0;
    int ans = 0;
    for ( int i = 0;
    i < N;
    i ++ ) {
      for ( int j = i + 1;
      j < N;
      j ++ ) {
        for ( int k = j + 1;
        k < N;
        k ++ ) {
          sum = A [ i ] + A [ j ] + A [ k ];
          if ( sum % M == 0 ) ans ++;
        }
      }
    }
    return ans;
  }