ZOJ 2559 The Smart Bomb
2013-09-05 20:00
302 查看
题意:给定你三个圆心,三个圆相交,求每个圆心大小
解题代码:由于任意两个圆的半径和为其圆心的连线的长度,可以列出三个二元一次方程,求解可得
解题代码:
View Code
解题代码:由于任意两个圆的半径和为其圆心的连线的长度,可以列出三个二元一次方程,求解可得
解题代码:
#include <stdio.h> #include <string.h> #include <stdlib.h> #include <math.h> double distance(double x1,double y1,double x2,double y2) { return sqrt((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2)); } int main() { double x1,x2,x3,y1,y2,y3; while(scanf("%lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3) != EOF) { double d1 = distance(x1,y1,x2,y2); double d2 = distance(x1,y1,x3,y3); double d3 = distance(x2,y2,x3,y3); double a,b,c; a = (d1+d3-d2)*1.0/2; b = (d2+d3-d1)*1.0/2; c = (d1+d2-d3)*1.0/2; printf("%lf\n%lf\n%lf\n",c,a,b); } return 0 ; }
View Code
相关文章推荐
- zoj-3938-Defuse the Bomb
- ZOJ 3938 Defuse the Bomb(水题)
- zoj Defuse the Bomb (模拟)
- ZOJ 3938 Defuse the Bomb(水题/细心模拟)
- ZOJ Problem Set - 3938 Defuse the Bomb
- zoj 3938 Defuse the Bomb
- ZOJ 146 - The 13th Zhejiang Provincial Collegiate Programming Contest - C Defuse the Bomb
- ZOJ 3938 Defuse the Bomb
- ACM刷题之ZOJ————Defuse the Bomb
- ZOJ Defuse the Bomb
- ZOJ 3938-Defuse the Bomb【模拟,题看着挺长】(2016浙江省大学生程序设计竞赛)
- zoj 2132 the most frequent number
- ZOJ 3885 The Exchange of Items(费用流)
- ZOJ-The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple-C
- ZOJ 2974 Just Pour the Water
- zoj 1610 Count the Colors(线段树)
- ZOJ 2770 Burn the Linked Camp 差分约束
- ZOJ 1610 Count the Colors(线段树——区间更新)(成段染色)
- ZOJ 1610 Count the Colors
- ZOJ 3819 Average Score The 2014 ACM-ICPC Asia Mudanjiang Regional Contest