uva10250 The Other Two Trees

来源：互联网发布：淘宝联盟升级高佣金编辑：程序博客网时间：2024/05/16 07:50

题意：给出正方形的一对点，然后求出另外两个点的坐标。

// #pragma comment(linker, "/STACK:1024000000,1024000000")#include <iostream>#include <algorithm>#include <iomanip>#include <sstream>#include <string>#include <stack>#include <queue>#include <deque>#include <vector>#include <map>#include <set>#include <stdio.h>#include <string.h>#include <math.h>#include <stdlib.h>#include <limits.h>using namespace std;typedef long long LL;typedef unsigned long long ULL;typedef pair<int,int> ii;const int inf = 1 << 30;const int INF = 0x3f3f3f3f;const int MOD = 1e9 + 7;struct point{double x,y;}a,b,f,c,d;int main(){// freopen("in.txt","r",stdin);// freopen("out.txt","w",stdout);while(scanf("%lf%lf%lf%lf",&a.x,&a.y,&b.x,&b.y)!=EOF){if (a.x == b.x && a.y == b.y){puts("Impossible.");continue;}double len = sqrt((a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y))/2;double k = (a.y - b.y)/(a.x-b.x);double t = sqrt(len*len/(k*k+1));f.x = (a.x+b.x)/2.0;f.y = (a.y+b.y)/2.0;c.x = f.x - k*t;c.y = f.y + t;d.x = f.x + k*t;d.y = f.y - t;printf("%.10lf %.10lf %.10lf %.10lf\n",c.x,c.y,d.x,d.y);}return 0;}

0 0