Jam's math problem(HDU5615)
来源:互联网 发布:淘宝app开发技术 编辑:程序博客网 时间:2024/05/30 05:13
Jam's math problem
代码:
#include<stdio.h>
#include<math.h>
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
long long int a,b,c,d,e;
scanf("%lld%lld%lld",&a,&b,&c);
d=b*b-4*a*c; //Δ小于0直接输出NO,因为这样就没解
if(d<0)printf("NO\n");
else
{
e=sqrt(d);
if(e*e==d)printf("YES\n"); //为完全平方数就输出YES
else printf("NO\n");
}
}
}
Problem Description
Jam has a math problem. He just learned factorization.
He is trying to factorizeax2+bx+c into the form of pqx2+(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.
He is trying to factorize
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.
Input
The first line is a number T , means there are T(1≤T≤100) cases
Each case has one line,the line has3 numbers a,b,c(1≤a,b,c≤100000000)
Each case has one line,the line has
Output
You should output the "YES" or "NO".
Sample Input
21 6 51 6 4
Sample Output
题意:方程的因式分解,十字相乘,例如x^2+6*x+5=(x+1)(x+5),这样就可以分解,可以通过Δ=b²-4ac进行判定,首先Δ得大于0,然后Δ=为完全平方数就可以分解,此处只需记住。。。。。。。。。。。。。。。。。YESNO
代码:
#include<stdio.h>
#include<math.h>
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
long long int a,b,c,d,e;
scanf("%lld%lld%lld",&a,&b,&c);
d=b*b-4*a*c; //Δ小于0直接输出NO,因为这样就没解
if(d<0)printf("NO\n");
else
{
e=sqrt(d);
if(e*e==d)printf("YES\n"); //为完全平方数就输出YES
else printf("NO\n");
}
}
}
0 0
- Jam's math problem(HDU5615)
- HDU5615:Jam's math problem
- HDU5615 Jam's math problem
- hdu5615 Jam's math problem (BestCoder Round #70)
- Jam's math problem
- Jam's math problem
- hdu5616 Jam's math problem
- Jam's math problem<hdoj5615>
- I - Jam's math problem
- HDU 5615 Jam's math problem(模拟)
- HDU 5615 Jam's math problem(十字相乘判定)
- HDU:5615 Jam's math problem(暴力,数学)
- hd 5615 Jam's math problem(枚举)
- HDU 5615 Jam's math problem(水~)
- HDOJ 5615 Jam's math problem
- HDOJ 5615-Jam's math problem【数学】
- HDU 5615 Jam's math problem
- HDU 5615 Jam's math problem
- Codeforces AIM Tech Round (Div. 2)解题报告
- 使用Behavior Designer插件简单制作NPC AI
- Android Studio使用sublime配色风格
- Python爬虫(单线程爬虫(三))
- sizeof()的理解
- Jam's math problem(HDU5615)
- 使用forword跳转后css失效
- c++ 成员函数作为函数指针参数传入
- IOS开发常用的网站
- 构建IoT系统必须的五项内容 (Page 3)
- 自平衡机器人DIY(二)
- Android 实战之: 去除安卓应用启动前闪烁的黑屏或白屏效果
- 单条剖析查询 SHOW PROFILE
- 算法学习--线性表