View Code of Problem 32

#include<stdio.h>
#include<math.h>
main()
{
	float d[2],hero[5][3],L,R,hurt,D;
	int i,j,n=0;
	for(i=0;i<2;i++)
	{
		scanf("%f",&d[i]);
	}
	for(i=0;i<5;i++)
	{
		for(j=0;j<3;j++)
		{
			scanf("%f",&hero[i][j]);
		}
	}
	scanf("%f%f",&L,&R);
    for(i=0;i<5;i++)
	{
		D=sqrt((hero[i][0]-d[0])*(hero[i][0]-d[0])+(hero[i][1]-d[1])*(hero[i][1]-d[1]));
		hurt=D*R;
		if(hurt>=hero[i][2] && L>=D)
		{
		n++;
		}
	}
if(n==0)
printf("NO");
else printf("YES");
}

Double click to view unformatted code.


Back to problem 32