hdu 6006(java 大数,三角形的外心)

因为有精度误差,所以用Bigdecimal直接模拟就行


import java.util.*;
import java.math.*;

public class Main
{
	public static BigDecimal fun(BigDecimal x)
	{
		return x.multiply(x);
	}
	public static void main(String []args)
	{
		Scanner in = new Scanner(System.in);
		int Tcase = in.nextInt();
		// System.out.println(Tcase);
		while ( (Tcase --) > 0 )
		{
			
			BigDecimal 
			x1 = in.nextBigDecimal() ,y1 = in.nextBigDecimal(),
			x2 = in.nextBigDecimal() ,y2 = in.nextBigDecimal(),
			x3 = in.nextBigDecimal() ,y3 = in.nextBigDecimal(),
			x4 = in.nextBigDecimal() ,y4 = in.nextBigDecimal();
			
			
			BigDecimal a = y3.subtract(y2).multiply(new BigDecimal(2) ).multiply( x2.multiply(x2).add(y2.multiply(y2)) .subtract( x1.multiply(x1)).subtract( y1.multiply(y1)));
			BigDecimal b = y2.subtract(y1).multiply(new BigDecimal(2)).multiply( x3.multiply(x3).add( y3.multiply(y3)).subtract( x2.multiply(x2)).subtract(y2.multiply(y2)));
			BigDecimal c = y3.subtract(y2).multiply(new BigDecimal(4)).multiply(x2.subtract(x1));
			BigDecimal d = y2.subtract(y1).multiply(new BigDecimal(4)).multiply(x3.subtract(x2));
			
			BigDecimal x = a.subtract(b).divide(c.subtract(d));
			// System.out.println(a + " " + b + " " + c + " " + d );
			
			a = x3.subtract(x2).multiply(new BigDecimal(-2)).multiply( x2.multiply(x2).add( y2.multiply(y2)).subtract(x1.multiply(x1)).subtract( y1.multiply(y1)));
			b = x2.subtract(x1).multiply(new BigDecimal(2)).multiply( x3.multiply(x3).add(y3.multiply(y3)).subtract(x2.multiply(x2)).subtract( y2.multiply(y2)));
			c = y3.subtract(y2).multiply(new BigDecimal(4)).multiply(x2.subtract(x1));
			d = y2.subtract(y1).multiply(new BigDecimal(4)).multiply(x3.subtract(x2));
			
			BigDecimal y = a.add(b).divide(c.subtract(d));
			
			BigDecimal r = fun(x.subtract(x1)).add( fun(y.subtract(y1)) );
			BigDecimal temp = fun(x.subtract(x4)).add(fun(y.subtract(y4)) );
			
			// System.out.println(x + " " + y);
			if(temp.compareTo(r) == 1)System.out.println("Accepted");
			else System.out.println("Rejected");
		}
	}
}







  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
根据提供的引用内容,HDU1622是一道关于二叉树的题目,要求读入一系列二叉树的节点信息,输出它们的层序遍历结果。如果输入的二叉树不完整或存在重复节点,则输出"not complete"。下面是Java的实现代码: ```java import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class Main { static class Node { int val; Node left, right; public Node(int val) { this.val = val; } } public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { String s = sc.nextLine(); if (s.isEmpty()) { continue; } String[] nodes = s.split("\\s+"); Node root = new Node(Integer.parseInt(nodes[0].substring(1))); Queue<Node> queue = new LinkedList<>(); queue.offer(root); boolean isComplete = true; for (int i = 1; i < nodes.length - 1; i += 2) { Node cur = queue.poll(); if (!nodes[i].equals("()")) { cur.left = new Node(Integer.parseInt(nodes[i].substring(1))); queue.offer(cur.left); } else { isComplete = false; } if (!nodes[i + 1].equals("()")) { cur.right = new Node(Integer.parseInt(nodes[i + 1].substring(0, nodes[i + 1].length() - 1))); queue.offer(cur.right); } else { isComplete = false; } } if (!isComplete) { System.out.println("not complete"); continue; } StringBuilder sb = new StringBuilder(); queue.offer(root); while (!queue.isEmpty()) { Node cur = queue.poll(); sb.append(cur.val).append(" "); if (cur.left != null) { queue.offer(cur.left); } if (cur.right != null) { queue.offer(cur.right); } } System.out.println(sb.toString().trim()); } } } ```

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值