Maximum Multiple

Maximum Multiple

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3985    Accepted Submission(s): 926

Problem Description

Given an integer n, Chiaki would like to find three positive integers x, y and z such that: n=x+y+z, x∣n, y∣n, z∣n and xyz is maximum.

Input

There are multiple test cases. The first line of input contains an integer T (1≤T≤106), indicating the number of test cases. For each test case:
The first line contains an integer n (1≤n≤106).

Output

For each test case, output an integer denoting the maximum xyz. If there no such integers, output −1 instead.

Sample Input

3

1

2

3

Sample Output

-1

-1

1

---

题解：

n = x + y + z，三个未知数相加，并且使x * y * z最大，令 a = n/ x  ,b = n / y, c = n / z,  则 1 / a + 1 / b + 1 / c = 1，且a , b , c 为正整数,则 a , b , c可取  （3 ，3，3），（2，4，4），（2，3，6），三种情况。

#include <stdio.h>

int main(){
	int t;
	while(~scanf("%d",&t)){
		while(t--){
			long long int n;
			scanf("%lld",&n);
			if(n%3 == 0)
				printf("%lld\n",1ll *n*n*n /27);
			else if(n%4==0)
				printf("%lld\n",1ll*n*n*n/32);
			else 
				printf("-1\n");			
		}

	}
}