2018年中南大学机试题

题目链接在这里

 

A.数学题，（附上草稿，不要嫌弃字丑），事实上就是这么化成一个数学式子

代码如下：

#include <iostream>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<fstream>
#include<queue>
#include<stack>
#include <algorithm>
#include <map>
using namespace std;
const int maxn = 1e3+5;
const int inf = 0x3f3f3f3f;
const int maxx = 1e3+50;
 
int main()
{
    int T;
    int tt = scanf("%d",&T);
    for(int ka = 1; ka<=T; ka++)
    {
       int x1,x2,y1,y2;
       int u1,u2,v1,v2;
       scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
       scanf("%d%d%d%d",&u1,&v1,&u2,&v2);
       int a,b,c,d;
       double ans = 0;
       a = x1-x2; b = u1-u2;  c = y1 - y2;  d = v1-v2;
       if(a*b+c*d > 0)
       {
           ans = sqrt((double)a*a + (double)c*c);
          // ans = ans + 5e-7;
       }
       else
       {
           double s1 = (double)a*b + (double)c*d;
           double s2 = (double)b*b + (double)d*d;
            double s3 = (double)a*a + (double)c*c;