Maximum Multiple（最大倍数）

题目链接
Maximum Multiple
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1535 Accepted Submission(s): 669

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=n,且x,y,z,都是n的因子(x|n,y|n,z|n),输出此时的x,y,z,的乘积即可。
解题思路：
总的解题思路就是，按照题意写出常规代码，输出全部结果，然后找规律，找到规律是三和四的倍数，然后对应处理输出即可。
注意：
刚开始做的时候，虽然找到规律了，但是还是过不了，因为超时，但是始终找不到错误点，最后把cin cout改成scanf printf过了……
代码篇：

#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
    long long int t,n;
    while(~scanf("%lld",&t))
    {
        while(t--)
        {
            scanf("%lld",&n);
            if(n%3==0)
                printf("%lld\n",(n/3)*(n/3)*(n/3));
            else if(n%4==0)
                printf("%lld\n",(n/4)*(n/4)*(n/2));
            else
                printf("-1\n");
        }
    }
    return 0;
}