SDUT- 2562 相似三角形

最新推荐文章于 2024-06-26 16:58:50 发布

Miracle_QSH

最新推荐文章于 2024-06-26 16:58:50 发布

阅读量417

点赞数

CC 4.0 BY-SA版权

分类专栏： JAVA

本文链接：https://blog.youkuaiyun.com/Miracle_QSH/article/details/83106477

JAVA 专栏收录该内容

18 篇文章

订阅专栏

本文介绍了一个使用Java编写的程序，该程序能够判断两组边长是否能构成相似的三角形。通过输入六条边的长度，程序首先对边长进行排序，然后检查两边之和是否大于第三边以确保构成三角形，最后比较两组三角形的边长比是否相等来判断是否相似。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

import java.util.Scanner;
class Judge
{
	double a, b, c, a1, b1, c1;
	Judge(double a, double b,double c, double a1, double b1, double c1)
	{
		this.a = a;
		this.a1 = a1;
		this.b = b;
		this.b1 = b1;
		this.c = c;
		this.c1 = c1;
		sort();
	}
	void sort()
	{
		double t;
		if(a > b){t = a; a = b; b = t;}
		if(b > c){t = b; b = c; c = t;}
		if(a > b){t = a; a = b; b = t;}
		if(a1 > b1){t = a1; a1 = b1; b1 = t;}
		if(b1 > c1){t = b1; b1 = c1; c1 = t;}
		if(a1 > b1){t = a1; a1 = b1; b1 = t;}
		
	}
	int IsOK()
	{
		if(a + b <= c || a + c <= b || b + c <= a)return 0;
		if(a1 + b1 <= c1 || a1 + c1 <= b1 || b1 + c1 <= a1)return 0;
		if(a / a1 == b / b1 && a / a1 == c / c1)return 1;
		else return 0;
		
	}
}
public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner cin = new Scanner(System.in);
		Judge ji;
		while(cin.hasNext())
		{
			ji = new Judge(cin.nextDouble(), cin.nextDouble(), cin.nextDouble(), cin.nextDouble(), cin.nextDouble(), cin.nextDouble());
			if(ji.IsOK() == 1)System.out.println("YES");
			else System.out.println("NO");
		}
		cin.close();
	}

}