SRM 668 DIV 2 AnArray 1000-point

Problem Statement

One day, Bob the Coder was wondering whether abstract programming problems can have applications in practice. The next day, he was selected to be on a quiz show. He will win one million dollars if he answers the following question: Given a vector A with N elements and an int K, count the number of tuples (p, q, r) such that 0 <= p < q < r < N and A[p] * A[q] * A[r] is divisible by K. Please compute and return the answer to Bob’s question.
Definition

Class:
AnArray
Method:
solveProblem
Parameters:
vector , int
Returns:
int
Method signature:
int solveProblem(vector A, int K)
(be sure your method is public)
Limits

Time limit (s):
2.000
Memory limit (MB):
256
Stack limit (MB):
256

Constraints

A w