Maximum Multiple

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

AC代码(分情况讨论被四整除和被三整除)

#include <iostream>
#include <bits/stdc++.h>
#include <string.h>
using namespace std;

int main()
{
    long long int n, t, a;
    while(scanf("%lld",&t)!=EOF)
    {
        while(t--)
        {
            scanf("%lld",&n);
            if(n%3==0)
            {
              n = n/3;
               printf("%lld\n",n*n*n);
            }
            else if(n%4==0)
            {
                printf("%lld\n",n*n*n/32);
            }
            else
                printf("-1\n");
        }
    }
    return 0;
}