zoukankan      html  css  js  c++  java
  • HDU 2298 Toxophily

    题目:

    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. 
    We all like toxophily. 

    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? 

    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. 
     

    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. 
    Technical Specification 

    1. T ≤ 100. 
    2. 0 ≤ x, y, v ≤ 10000. 
     

    Output

    For each test case, output the smallest answer rounded to six fractional digits on a separated line. 
    Output "-1", if there's no possible answer. 

    Please use radian as unit. 
     

    Sample Input

    3
    0.222018 23.901887 121.909183
    39.096669 110.210922 20.270030
    138.355025 2028.716904 25.079551
     

    Sample Output

    1.561582
    -1
    -1
     
    采用数学方法,很simple~
    但是WA了~错在.....很让人无语的地方......= =下次要细心点!!!!
    代码:
     1 #include<iostream>
     2 #include<math.h>
     3 #include<stdio.h>
     4 using namespace std;
     5 
     6 const double g=9.8;
     7 
     8 int main()
     9 {
    10     int n;
    11     scanf("%d",&n);
    12     while(n--)
    13     {
    14         double t,s,x,y,v;
    15         scanf("%lf%lf%lf",&x,&y,&v);
    16         t=v*v*v*v*x*x-g*x*x*(g*x*x+2*v*v*y);
    17         if(t<0)
    18             printf("-1
    ");
    19         else
    20         {
    21 
    22             s=(2*v*v*x-2*sqrt(t))/(2*g*x*x);
    23             if(s<0)
    24                 s=(2*v*v*x+2*sqrt(t))/(2*g*x*x);
    25             printf("%.6lf
    ",atan(s));
    26         }
    27     }
    28     return 0;
    29 }
     
     
     
     
     
  • 相关阅读:
    [Leetcode]设计链表
    [Leetcode]最小栈
    复杂JSON反序列化为类对象
    Big Data Solution in Azure: Azure Data Lake
    EF vs ADO.NET
    EF5.0默认不支持DB First了?
    WebService/WCF/WebAPI区别
    AugularJS1.X不升级到2.X
    数据库中锁的问题
    MVC中路由匹配的规则
  • 原文地址:https://www.cnblogs.com/teilawll/p/3229066.html
Copyright © 2011-2022 走看看