数学--数论--HDU-2698 Maximum Multiple（规律）

Given an integer nn, Chiaki would like to find three positive integers xx, yy and zzsuch that: n=x+y+zn=x+y+z, x∣nx∣n, y∣ny∣n, z∣nz∣n and xyzxyz is maximum.

Input

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

Output

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

Sample Input

Sample Output

-1
-1
1

只有因子中有4或者有3才能被拆成 X+Y+Z=N,然后打了表验证。
最后wa了好几次，是因为int和int计算之后还是int就算赋值给long long .
打表代码

#include <bits/stdc++.h>
using namespace std;
int main()
{int T;scanf("%d", &T);while (T--){int n;for (int n = 1; n <= 100; n++){int maxt = -1;int a, b, c;for (int x = 1; x <= n; x++){for (int y = 1; y <= n - x; y++){int z = n - x - y;if (z && n % x == 0 && n % y == 0 && n % z == 0){if (maxt < x * y * z){a = x;b = y;c = z;}maxt = max(maxt, x * y * z);}}}printf("%d:%5d %d %d %d\n", n, maxt, a, b, c);if (n % 12 == 0)printf("\n");}}return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{int T;long long  n,x,y,z;long long sum;scanf("%d", &T);while (T--){scanf("%lld", &n);if ((n % 3) == 0){x = y = z = n / 3;sum = x * y * z;if (x + y + z == n)printf("%lld\n", sum);elseputs("-1");}else if ((n % 4) == 0){x = y = n / 4, z = n / 2;sum = x * y * z;if (x + y + z == n)printf("%lld\n", sum);elseputs("-1");}elseputs("-1");}
}

数学--数论--HDU-2698 Maximum Multiple（规律）相关推荐

数学--数论--HDU 2582 F(N) 暴力打表找规律
This time I need you to calculate the f(n) . (3<=n<=1000000) f(n)= Gcd(3)+Gcd(4)+-+Gcd(i)+-+Gc ...
数学--数论--HDU - 6322 打表找规律
In number theory, Euler's totient function φ(n) counts the positive integers up to a given integer n ...
数学--数论--HDU 2197 本原串 (推规律）
由0和1组成的串中,不能表示为由几个相同的较小的串连接成的串,称为本原串,有多少个长为n(n<=100000000)的本原串? 答案mod2008. 例如,100100不是本原串,因为他是由两个 ...
数学--数论--HDU - 6395 Let us define a sequence as below 分段矩阵快速幂
Your job is simple, for each task, you should output Fn module 109+7. Input The first line has only ...
数学--数论--Hdu 5793 A Boring Question （打表+逆元）
There are an equation. ∑0≤k1,k2,⋯km≤n∏1⩽j<m(kj+1kj)%1000000007=? We define that (kj+1kj)=kj+1!kj! ...
数学--数论--HDU 12151七夕节 Plus （因子和线性筛）
Problem Description 七夕节那天,月老来到数字王国,他在城门上贴了一张告示,并且和数字王国的人们说:"你们想知道你们的另一半是谁吗?那就按照告示上的方法去找吧!" ...
数学--数论-- HDU 2601 An easy problem（约束和）
Problem Description When Teddy was a child , he was always thinking about some simple math problems ...
数学--数论--HDU 6128 Inverse of sum （公式推导论）
Description 给nn个小于pp的非负整数a1,-,na1,-,n,问有多少对(i,j)(1≤i<j≤n)(i,j)(1≤i<j≤n)模pp在意义下满足1ai+aj≡1ai+1aj ...
数学--数论--HDU 4675 GCD of Sequence(莫比乌斯反演+卢卡斯定理求组合数+乘法逆元+快速幂取模）
先放知识点: 莫比乌斯反演卢卡斯定理求组合数乘法逆元快速幂取模 GCD of Sequence Alice is playing a game with Bob. Alice shows N i ...
数学--数论--HDU 2674 沙雕题
WhereIsHeroFrom: Zty, what are you doing ? Zty: I want to calculate N!.. WhereIsHeroFrom: So easy! H ...

数学--数论--HDU-2698 Maximum Multiple（规律）

数学--数论--HDU-2698 Maximum Multiple（规律）相关推荐

最新文章

热门文章