Mark is solving an interesting question. He needs to find out number of distinct ways such...

Transcribed Image Text:

Mark is solving an interesting question. He needs to find out number of distinct ways such that (i+ 2*j + k) % ( x + y + 2*z) = 0, where 1 <= i, j, k, x, y, z <= N. Help him find it. Constraints: 1 <= T <= 10 1 <= N <= 1000 Input Format First line contains T, the number of test cases. Each of the test case contains a single integer, N in a seperate line. Output Format For each test case, output in a seperate line, the number of distinct ways. Sample Input Sample Output 1 15 Explanation In the first case, the only possible way is i =j = k = x = y = z =1. 212 Mark is solving an interesting question. He needs to find out number of distinct ways such that (i+ 2*j + k) % ( x + y + 2*z) = 0, where 1 <= i, j, k, x, y, z <= N. Help him find it. Constraints: 1 <= T <= 10 1 <= N <= 1000 Input Format First line contains T, the number of test cases. Each of the test case contains a single integer, N in a seperate line. Output Format For each test case, output in a seperate line, the number of distinct ways. Sample Input Sample Output 1 15 Explanation In the first case, the only possible way is i =j = k = x = y = z =1. 212

Answer rating: 100% (QA)

import javautilScanner public class ... View the full answer