Maximum Multiple

最新推荐文章于 2018-08-02 13:27:08 发布

Staydesting

最新推荐文章于 2018-08-02 13:27:08 发布

阅读量211

点赞数

本文链接：https://blog.csdn.net/Staydesting/article/details/81178264

版权

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

答案：

#include<stdio.h>
int main()
{
    long long int n, s;
    long long int mmax;
    scanf("%d", &n);
    while (n--)
    {
        mmax = 0;
        scanf("%lld", &s);
        if (s % 12 == 1 || s % 12 == 2 || s % 12 == 5 || s % 12 == 7 || s % 12 == 10 || s % 12 == 11)
            printf("-1\n");//每12个数轮一轮
        else
        {
            if (s % 3 == 0)
                mmax = (s / 3)*(s / 3)*(s / 3);//如果是3的倍数，就是s/3的三次方
            else
                mmax = (s / 4)*(s / 4)*(s / 4) * 2;//其他的就是这个数的四分之一*四分之一*二分之一
            printf("%lld\n", mmax);
        }
    }
    return 0;
}