For this Question: Abhas likes to play with numbers. He is given integers N and K. Find the number of triples (a, b, c) of positive integers not greater than N such that a+b, b+c, and c+a are all multiples of K. The order of a, b, and c does matter, and some of them can be the same.The input line contains N and K separated by space.


<b>Constraints</b>
1&le;N, K&le;2×10^5
 
N and K are integers.Print the number of triples (a, b, c) of positive integers not greater than N such that a+b, b+c, and c+a are all multiples of K.<b>Sample Input 1</b>
3 2

<b>Sample Output 1</b>
9

<b>Sample Input 2</b>
5 3

<b>Sample Output 2</b>
1

<b>Sample Input 3</b>
35897 932

<b>Sample Output 3</b>
114191, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll get(ll x) {
	return x*x*x;
}
int main() {
	ll n,k,ans=0;
	cin>>n>>k;
	if (k&1) {
		cout<<get(n/k);
	}
	else {
		cout<<get(n/k)+get(2*n/k-n/k);
	}
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?