三角问题

Toxophily

Time Limit : 3000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 30   Accepted Submission(s) : 14

Problem Description

The recreation center of WHU ACM Team has indoor billiards, Ping Pang, chess and bridge, toxophily, deluxe ballrooms KTV rooms, fishing, climbing, and so on.<br>We all like toxophily.<br><br>Bob is hooked on toxophily recently. Assume that Bob is at point (0,0) and he wants to shoot the fruits on a nearby tree. He can adjust the angle to fix the trajectory. Unfortunately, he always fails at that. Can you help him?<br><br>Now given the object's coordinates, please calculate the angle between the arrow and x-axis at Bob's point. Assume that g=9.8N/m. <br>

 

Input

The input consists of several test cases. The first line of input consists of an integer T, indicating the number of test cases. Each test case is on a separated line, and it consists three floating point numbers: x, y, v. x and y indicate the coordinate of the fruit. v is the arrow's exit speed.<br>Technical Specification<br><br>1. T ≤ 100.<br>2. 0 ≤ x, y, v ≤ 10000. <br>

 

Output

For each test case, output the smallest answer rounded to six fractional digits on a separated line.<br>Output "-1", if there's no possible answer.<br><br>Please use radian as unit. <br>

 

Sample Input

  
  

   
   3<br>0.222018 23.901887 121.909183<br>39.096669 110.210922 20.270030<br>138.355025 2028.716904 25.079551<br>
  
  

 

Sample Output

  
  

   
   1.561582<br>-1<br>-1<br>
  
  

 

Source

The 4th Baidu Cup final

数学公式解题

直接上代码！！

#include <cstdio>
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<numeric>
#include<math.h>
#include<string.h>
#include<map>
#include<set>
#include<vector>
#include<iomanip>
using namespace std;
double pi=acos(-1.0);
double g=9.8;
double paopao;
int main()
{
    int n;
    cin>>n;
    int i;
    double x,y,v;
    for(i=1;i<=n;i++)
    {
        cin>>x>>y>>v;
        paopao=3;
        double a=g*x*x;
        double b=-2*v*v*x;
        double c=2*v*v*y+g*x*x;
        double der=b*b-4*a*c;
        if(der<0)
        {
            cout<<"-1"<<endl;
            continue;
        }
        double pao1=atan((-b-sqrt(der))/(2*a));
        double pao2=atan((-b+sqrt(der))/(2*a));//数学公式 。。
        if(pao1>=0&&pao1<=pi/2)
            paopao=min(paopao,pao1);
        if(pao2>=0&&pao2<=pi/2)
            paopao=min(paopao,pao2);
        cout<<fixed<<setprecision(6)<<paopao<<endl;
    }
    return 0;
}