hdu6298

Maximum Multiple

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

 

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

x∣n: 表示x是n的因子，而不是x或n。

解析：写几个数可以发现，1 。是质数就为-1；

2。然后n%3==0也可以；

3。n%4也可以（why？？？）因为，假设n/4=x，然后我们可以发现 可以x%2==0；就是说明x可以被分成两个部分，也就是它的因子相加。说明假设的n%4是可以求出xyz的

4。其他情况为-1

5。记得要long long （int会溢出）

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

#define e exp(1)
#define pi acos(-1)
#define mod 1000000007
#define inf 0x3f3f3f3f
#define ull unsigned long long
#define ll long long

int main()
{
    int t;scanf("%d",&t);
    while(t--)
    {
        ll n;scanf("%lld",&n);
        if(n%3==0)
        {
            printf("%lld\n",n/3*(n/3)*(n/3));
        }
        else if(n%4==0)
        {
            ll x=n/4;
            printf("%lld\n",x*x*n/2);
        }
        else puts("-1");
    }
    return 0;
}