赞
踩
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 447 Accepted Submission(s): 189
Problem Description
There is a slope on the 2D plane. The lowest point of the slope is at the origin. There is a small ball falling down above the slope. Your task is to find how many times the ball has been bounced on the slope.
It's guarantee that the ball will not reach the slope or ground or Y-axis with a distance of less than 1 from the origin. And the ball is elastic collision without energy loss. Gravity acceleration g=9.8m/s2.
Input
There are multiple test cases. The first line of input contains an integer T (1 ≤ T ≤ 100), indicating the number of test cases.
The first line of each test case contains four integers a, b, x, y (1 ≤ a, b, -x, y ≤ 100), indicate that the slope will pass through the point(-a, b), the initial position of the ball is (x, y).
Output
Output the answer.
It's guarantee that the answer will not exceed 50.
Sample Input
1
5 1 -5 3
Sample Outpu
2
有一个小球在(x,y)点自由落体到斜率为(-b/a)的斜坡上,做完全弹性碰撞,终点为原点,问小球能够弹几次
这道题,高中生一定能做出来,留下了学渣的泪水。
这道题只有重力一个力,那么我们可以把重力分解为两个力,aa垂直slope, a0平行于slope向右。
那么这个小球作的运动就是:1、向右不断加速 2、上下跳动同样的高度
简单来说把slope水平放置的时候,一切都清楚了
求出总路程的时间,在除以上下一次的时间,就是弹跳的次数
- #include <stdio.h>
- #include <math.h>
- using namespace std;
- #define g 9.8
-
- int main() {
- int t;
- scanf("%d", &t);
- while (t--){
- double a, b ,x, y;
- scanf("%lf %lf %lf %lf", &a, &b, &x, &y);
- double d = sqrt(a*a + b*b);
- double k = (-1.0*b/a);
- //double h = abs((k*x + y) / d);
- double h = y-(k*x);
- double hh = a*h/d;
- double hhh = b*h/d;
- double dd = sqrt(x*x + k*x*k*x);
- double a0 = b*g/d;
- double aa = a*g/d;
- double t = sqrt(2*hh/aa);
- double s = dd+hhh;
- double tt = sqrt(2*s/a0);
- int sum = tt/t;
- //printf("g=%lf\n", g);
- sum -= 1;
- sum /= 2;
- sum += 1;
- //printf("hhh=%lf\n",hhh);
- //printf("tt=%lf t=%lf\n", tt, t);
- printf("%d\n",sum);
-
- }
- }
Copyright © 2003-2013 www.wpsshop.cn 版权所有,并保留所有权利。