当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5615:Jam's math problem

题目描述
Jam has a math problem. He just learned factorization.
He is trying to factorize $ax^2+bx+c$ into the form of $pqx^2+(qk+mp)x+km=(px+k)(qx+m)$.
He could only solve the problem in which p,q,m,k are positive numbers.
Please help him determine whether the expression could be factorized with p,q,m,k being postive.
输入解释
The first line is a number $T$, means there are $T(1 \leq T \leq 100 )$ cases

Each case has one line,the line has $3$ numbers $a,b,c (1 \leq a,b,c \leq 100000000)$
输出解释
You should output the "YES" or "NO".
输入样例
2
1 6 5
1 6 4
输出样例
YES
NO

提示
The first case turn $x^2+6*x+5$ into $(x+1)(x+5)$
来自杭电HDUOJ的附加信息
Recommend hujie

该题目是Virtual Judge题目,来自 杭电HDUOJ

题目来源 BestCoder Round #70

源链接: HDU-5615

最后修改于 2020-10-25T23:24:13+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/65536K(Java/Others)