首页 > ACM题库 > HDU-杭电 > HDU 3343-An ant’s story[解题报告]HOJ
2014
03-16

HDU 3343-An ant’s story[解题报告]HOJ

An ant’s story

问题描述 :

Long long ago, there is an ant crawling on an L-meter magic rubber band with speed of v cm/s.The magic rubber band will elongate m meters every second. We can assume that the magic rubber band elongates equably. Now, the ant is on the start point and crawling to another point, please tell me whether it can reach the endpoint.

输入:

The first line of the input is T, which stands for the number of test cases you need to solve.
Each case include three integers: L , v , m ( 0< L< 10^9,0<= v, m< 10^ 9,).

输出:

The first line of the input is T, which stands for the number of test cases you need to solve.
Each case include three integers: L , v , m ( 0< L< 10^9,0<= v, m< 10^ 9,).

样例输入:

1
99999 61 1

样例输出:

YES

/*
分析:
    当v>0的时候,就肯定可以YES滴~。
看了网上那么多的解释,用了什么积分呀啥的额,好麻烦呀+_+。

我来解释下哈:
   杆是均匀伸长的对吧哈~
然后,假设蚂蚁左方杆长L1、右方L2,并假设L=L1+L2,k=L1/L。
如果蚂蚁站在那儿不动,杆不管怎么均匀伸长,k值不变。这个很容易
理解对吧哈~
   那么蚂蚁开始向右动了腻~,那么k是不是在不断增大呀~,不管这
个k增大的多~么慢,是不是一直在增大呀~。又由于蚂蚁的速度是恒定
的,那么理论上,是不是k就可以增大到1呀~,那么answer是不是就出
来了腻~。
PS:仔细想想,k的增长速率,是越来越快、还是越来越慢、还是不确
定腻~(仔细想想,左边的杆所占的比例是越来越大的说哦~)

                                                        2012-05-11
*/

#include"stdio.h"
int main()
{
	int T;
	int l,v,m;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d%d",&l,&v,&m);
		if(v>0)	printf("YES\n");
		else	printf("NO\n");
	}
	return 0;
}

参考:http://blog.csdn.net/ice_crazy/article/details/7558822