POJ1329-Circle Through Three Points

最新推荐文章于 2018-04-22 21:37:53 发布
最新推荐文章于 2018-04-22 21:37:53 发布
阅读量731 收藏
点赞数
分类专栏： 解析几何 文章标签： 三角形外接圆
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/ecjtu_yuweiwei/article/details/38350733
版权
Circle Through Three Points
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 3262 Accepted: 1384

Description

Your team is to write a program that, given the Cartesian coordinates of three points on a plane, will find the equation of the circle through them all. The three points will not be on a straight line.
The solution is to be printed as an equation of the form 
	(x - h)^2 + (y - k)^2 = r^2				(1)

and an equation of the form 
	x^2 + y^2 + cx + dy - e = 0				(2)

Input

Each line of input to your program will contain the x and y coordinates of three points, in the order Ax, Ay, Bx, By, Cx, Cy. These coordinates will be real numbers separated from each other by one or more spaces.

Output

Your program must print the required equations on two lines using the format given in the sample below. Your computed values for h, k, r, c, d, and e in Equations 1 and 2 above are to be printed with three digits after the decimal point. Plus and minus signs in the equations should be changed as needed to avoid multiple signs before a number. Plus, minus, and equal signs must be separated from the adjacent characters by a single space on each side. No other spaces are to appear in the equations. Print a single blank line after each equation pair.

Sample Input

7.0 -5.0 -1.0 1.0 0.0 -6.0
1.0 7.0 8.0 6.0 7.0 -2.0

Sample Output

(x - 3.000)^2 + (y + 2.000)^2 = 5.000^2
x^2 + y^2 - 6.000x + 4.000y - 12.000 = 0

(x - 3.921)^2 + (y - 2.447)^2 = 5.409^2
x^2 + y^2 - 7.842x - 4.895y - 7.895 = 0

Source

Southern California 1989,UVA 190
//AC代码 
/*
题意：有三个点A,B,C组成三角形，求这三角形的外接圆用两个公式表示
三角形的外接圆圆心：任意两条边的垂直平分线的交点，半径该交点到任意三个顶点的距离

另外此题有直接求外接圆的圆心和半径的公式：http://blog.csdn.net/ecjtu_yuweiwei/article/details/38350587
我是直接模拟
*/
#include<iostream>
#include<queue>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iomanip>
#include<map>
#include<cstdlib>
#include<cmath>
#include<vector>
#define LL long long
#define IT __int64
#define zero(x) fabs(x)<eps
#define mm(a,b) memset(a,b,sizeof(a))
const int INF=0x7fffffff;
const double inf=1e8;
const double eps=1e-10;
const double PI=acos(-1.0);
const int Max=20001;
using namespace std;
int sign(double x)
{
    return (x>eps)-(x<-eps);
}
typedef struct Node
{
    double x;
    double y;
    Node(const double &_x=0, const double &_y=0) : x(_x), y(_y) {}
    void input()
    {
        cin>>x>>y;
    }
    void output()
    {
        cout<<x<<" "<<y<<endl;
    }
}point;
point A,B,C;
point AB,BC;
point Center;
double k1,k2,k3,k4,R;
double b1,b2;
double xmult(point p0,point p1,point p2)
{
	return(p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
double dmult(point p0,point p1,point p2)
{
	return(p1.x-p0.x)*(p2.x-p0.x)+(p1.y-p0.y)*(p2.y-p0.y);
}
double Distance(point p1,point p2)// 返回两点之间欧氏距离
{
	return( sqrt( (p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y) ) );
}
double slope(point u,point v)
{
    if(sign(v.x-u.x)==0)
        return INF;
    else
        return (v.y-u.y)/(v.x-u.x);
}
int main()
{
    int n,m,i,j;
    while(cin>>A.x>>A.y)
    {
        B.input();
        C.input();
        AB.x=(A.x+B.x)/2;
        AB.y=(A.y+B.y)/2;
        BC.x=(B.x+C.x)/2;
        BC.y=(B.y+C.y)/2;
        k1=slope(A,B);
        k2=slope(B,C);
        Center.x=INF;
        Center.y=INF;
        if(k1==INF)
        {
            k3=0;
            Center.y=AB.y;
        }
        if(k2==INF)
        {
            k4=0;
            Center.y=BC.y;
        }
        if(k1==0)
        {
            k3=INF;
            Center.x=AB.x;
        }
        if(k2==0)
        {
            k4=INF;
            Center.x=BC.x;
        }
        if(Center.x!=INF&&Center.y!=INF)
        {
            //cout<<"111"<<endl;
            R=Distance(Center,A);
            char a,b,c;
            double res;
            res=pow(Center.x,2)+pow(Center.y,2)-pow(R,2);
            if(Center.x<0)
                a='+';
            else
                a='-';
            if(Center.y<0)
                b='+';
            else
                b='-';
            if(res<0)
                c='-';
            else
                c='+';
            cout<<"(x "<<a<<" ";
            cout<<setprecision(3)<<setiosflags(ios::fixed)<<fabs(Center.x)<<")^2 + (y "<<b<<" ";
            cout<<setprecision(3)<<setiosflags(ios::fixed)<<fabs(Center.y)<<")^2 = ";
            cout<<setprecision(3)<<setiosflags(ios::fixed)<<R<<"^2"<<endl;

            cout<<"x^2 + y^2 "<<a<<" "<<fabs(2*Center.x)<<"x "<<b<<" "<<fabs(2*Center.y)<<"y "<<c<<" "<<fabs(res)<<" = 0"<<endl;
        }
        else
        {
            if(Center.x==INF&&Center.y==INF)
            {
                k3=-1.0/k1;
                k4=-1.0/k2;
                //cout<<"222"<<endl;
               // AB.output();
               // BC.output();
                b1=AB.y-k3*AB.x;
                b2=BC.y-k4*BC.x;
                //cout<<k3<<" "<<k4<<" "<<b1<<" "<<b2<<endl;
                Center.x=(b2-b1)/(k3-k4);
                Center.y=k3*Center.x+b1;
                //cout<<Center.x<<" "<<Center.y<<endl;
                R=Distance(Center,A);
                //cout<<"ok:: "<<Distance(Center,B)<<" "<<Distance(Center,C)<<endl;
                char a,b,c;
                double res;
                res=pow(Center.x,2)+pow(Center.y,2)-pow(R,2);
                if(Center.x<0)
                    a='+';
                else
                    a='-';
                if(Center.y<0)
                    b='+';
                else
                    b='-';
                if(res<0)
                    c='-';
                else
                    c='+';
                cout<<"(x "<<a<<" ";
                cout<<setprecision(3)<<setiosflags(ios::fixed)<<fabs(Center.x)<<")^2 + (y "<<b<<" ";
                cout<<setprecision(3)<<setiosflags(ios::fixed)<<fabs(Center.y)<<")^2 = ";
                cout<<setprecision(3)<<setiosflags(ios::fixed)<<R<<"^2"<<endl;

                cout<<"x^2 + y^2 "<<a<<" "<<fabs(2*Center.x)<<"x "<<b<<" "<<fabs(2*Center.y)<<"y "<<c<<" "<<fabs(res)<<" = 0"<<endl;
            }
            else
            {
                if(Center.x==INF&&Center.y!=INF)
                {
                    if(k3==0)
                    {
                        k4=-1.0/k2;
                        b2=BC.y-k4*BC.x;
                        Center.x=(Center.y-b2)/k4;
                    }
                    if(k4==0)
                    {
                        k3=-1.0/k1;
                        b1=AB.y-k3*AB.x;
                        Center.x=(Center.y-b1)/k3;
                    }
                    //cout<<"222"<<endl;
                    //AB.output();
                    //BC.output();
                    //cout<<k3<<" "<<k4<<" "<<b1<<" "<<b2<<endl;
                    //Center.x=(b2-b1)/(k3-k4);

                    //cout<<Center.x<<" "<<Center.y<<endl;
                    R=Distance(Center,A);
                    //cout<<"ok:: "<<Distance(Center,B)<<" "<<Distance(Center,C)<<endl;
                    char a,b,c;
                    double res;
                    res=pow(Center.x,2)+pow(Center.y,2)-pow(R,2);
                    if(Center.x<0)
                        a='+';
                    else
                        a='-';
                    if(Center.y<0)
                        b='+';
                    else
                        b='-';
                    if(res<0)
                        c='-';
                    else
                        c='+';
                    cout<<"(x "<<a<<" ";
                    cout<<setprecision(3)<<setiosflags(ios::fixed)<<fabs(Center.x)<<")^2 + (y "<<b<<" ";
                    cout<<setprecision(3)<<setiosflags(ios::fixed)<<fabs(Center.y)<<")^2 = ";
                    cout<<setprecision(3)<<setiosflags(ios::fixed)<<R<<"^2"<<endl;

                    cout<<"x^2 + y^2 "<<a<<" "<<fabs(2*Center.x)<<"x "<<b<<" "<<fabs(2*Center.y)<<"y "<<c<<" "<<fabs(res)<<" = 0"<<endl;
                }
                else if(Center.x!=INF&&Center.y==INF)
                {
                    if(k3==INF)
                    {
                        k4=-1.0/k2;
                        b2=BC.y-k4*BC.x;
                        Center.y=k4*Center.x+b2;
                    }
                    if(k4==INF)
                    {
                        k3=-1.0/k1;
                        b1=AB.y-k3*AB.x;
                        Center.y=k3*Center.x+b1;
                    }
                    R=Distance(Center,A);
                    //cout<<"ok:: "<<Distance(Center,B)<<" "<<Distance(Center,C)<<endl;
                    char a,b,c;
                    double res;
                    res=pow(Center.x,2)+pow(Center.y,2)-pow(R,2);
                    if(Center.x<0)
                        a='+';
                    else
                        a='-';
                    if(Center.y<0)
                        b='+';
                    else
                        b='-';
                    if(res<0)
                        c='-';
                    else
                        c='+';
                    cout<<"(x "<<a<<" ";
                    cout<<setprecision(3)<<setiosflags(ios::fixed)<<fabs(Center.x)<<")^2 + (y "<<b<<" ";
                    cout<<setprecision(3)<<setiosflags(ios::fixed)<<fabs(Center.y)<<")^2 = ";
                    cout<<setprecision(3)<<setiosflags(ios::fixed)<<R<<"^2"<<endl;

                    cout<<"x^2 + y^2 "<<a<<" "<<fabs(2*Center.x)<<"x "<<b<<" "<<fabs(2*Center.y)<<"y "<<c<<" "<<fabs(res)<<" = 0"<<endl;
                }
            }
        }
        cout<<endl;
    }
    return 0;
}

ECJTU_ACM_余伟伟
关注
专栏目录
poj1329——求三角形的外接圆（注意格式）
mumei的博客
09-28 435
题目链接： Your team is to write a program that, given the Cartesian coordinates of three points on a plane, will find the equation of the circle through them all. The three points will not be on a straig...
魔兽世界终极版POJ的-测试数据
11-03
这是魔兽世界终极版POJ的-测试数据，找了好久才找到的。 本来想设置为0积分，但是它居然自动收费(o_ _)ﾉ。 看传送门：https://pan.baidu.com/s/1cCIwW8psGDASu2JdZawG3Q
POJ1329Circle Through Three Points
小黄人快跑的博客
08-24 658
赤裸裸的求三角形外接圆，即根据三点坐标确定圆心坐标和圆的半径。        关键点在于已知三点，我们要求圆的表达式，大二高数结束后这数学算是好久不碰，推个公式推得不要不要的，如果是参加竞赛劝诫大家最好把这些数学公式做成模板：                  a=2*(x2-x1); b=2*(y2-y1); c=pow(x2,2)+pow(y2,2)-pow(x1,2)-pow(y1,
Circle Through Three Points
weixin_30576859的博客
08-22 103
Circle Through Three Points Time Limit : 2000/1000ms (Java/Other)Memory Limit : 20000/10000K (Java/Other) Total Submission(s) : 37Accepted Submission(s) : 10 Problem Description Your team is...
POJ 1329 Circle Through Three Points
Peanuts_D
08-22 776
题意：给你三个圆上的点，求圆的两种表达式。首先普及知识： 外接圆半径:公式:a/sinA=b/sinB=c/sinC=2R (R就是外接圆半径)  本题可以这样：①．先利用余弦定理：a^2=b^2+c^2－2bc·cosA  求出：cosA=(b^2+c^2－a^2)/2bc 在利用公式：sinA^2+cosA^2=1 确定 sinA=根号(1－cosA^2) =根号[(a^2+b^2
POJ 1329 Circle Through Three Points
weixin_33842328的博客
02-16 93
POJ_1329     题目主要就是在求三角形的外心，即各边中垂线的交点，推导出公式后直接计算即可。 #include&lt;stdio.h&gt;#include&lt;string.h&gt;#include&lt;math.h&gt;#define zero 1e-8double x3, y3, x4, y4, x5, y5;double dcmp(double x){ if...
poj1038--Bugs.rar_Bugs_poj 1038 _poj10_poj1038
09-20
标题中的“poj1038--Bugs.rar”是一个关于解决编程竞赛问题的压缩文件，其中包含了对“Bugs”问题的解答。POJ（Problemset Online Judge）是一个在线编程竞赛平台，它提供了一系列的问题供参赛者解决，旨在锻炼和...
POJ2002-Squares
07-31
【标题】"POJ2002-Squares"是一个经典的计算机编程题目，源自北京大学的在线判题系统（POJ，即PKU Online Judge）。这个题目主要涉及到算法设计和实现，尤其是数学和动态规划方面的知识。 【描述】"解题报告+AC代码...
POJ---1456.Supermarket测试数据及答案
04-25
POJ---1456.Supermarket测试数据及答案，题目描述:A supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral ...
POJ1724-ROADS 测试数据
06-26
标题中的"POJ1724-ROADS"是一个经典的编程竞赛题目，源自1998年CEOI（国际信息学奥林匹克竞赛）的第二轮。这个题目在编程竞赛圈子内广为流传，常被用于训练参赛者的算法和数据结构技能。POJ（Programming Online ...
poj 1329 Circle Through Three Points(三点求圆方程)
志当存高远
09-15 1406
Circle Through Three Points Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 2785   Accepted: 1179 Description Your team is to write a program that, given the
poj1329 Circle Through Three Points
喵呜的Blog
01-15 3730
Circle Through Three Points Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 3130   Accepted: 1325 Description Your team is to write a program that, given t
poj1329 Circle Through Three Points 三角形外接圆（水）
java开发指南博客 【转载】
08-02 114
题目链接：http://poj.org/problem?id=1329 给出三个点，求外接圆的两种表达式： //代码如下： #include&lt;iostream&gt; #include&lt;cstdio&gt; #include&lt;math.h&gt; #define eps 1e-8 struct point{double x,y;}; point a,b,c; doubl...
poj 1329 Circle Through Three Points
&&&思考中前行～～
08-08 499
此题目的输出好恶心..WA一次之后，发现输出的时候，有些情况没考虑到，重新再敲代码，以至于代码敲了老长老长...还有A过去了。 代码如下：#include #include #include using namespace std; struct point { dou
POJ 1329 Circle Through Three Points(求三角形的外接圆)
GLSilence的专栏
11-10 1670
Circle Through Three Points 题目大意: 给你三个不共线的三个点的坐标，求出过这三个点的圆的方程。写出方程的两种形式。 解题思路： 其实题目要求写出的方程的形式中包含圆心坐标跟半径，所以说关键问题其实就是求出过三点圆的圆心跟半径就OK了。 其实就是个求三角形外接圆的题目，最后加上一些蛋疼的输出控制就可以了。
UVA 190 - Circle Through Three Points
liuxinyu666的博客
04-22 283
题意：给出三点坐标，求过三点圆的标准方程和一般方程解法：已知两点(x1,y1)(x2,y2)求直线中垂线方程ax+by+c=0结论：a= x2-x1,b=y2-y1,c=(x1*x1-x2*x2+y1*y1-y2*y2)/2已知两直线方程a1x+b1y+c1=0，a2x+b2y+c2=0求交点结论： (  (b1*c2-b2*c1)/ (a1*b2-b1*a2)  ,  (c1*a2-c2*a1)...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值